The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Hierarchical packet fair queueing algorithms
Abstract
We propose to use the idealized hierarchical generalized processor sharing (H-GPS) model to simultaneously support guaranteed real-time, rate-adaptive best-effort, and controlled link-sharing services. We design hierarchical packet fair queueing (H-PFQ) algorithms to approximate H-GPS by using one-level variable-rate PFQ servers as basic building blocks. By computing the system virtual time and per packet virtual start/finish times in unit of bits instead of seconds, most of the PFQ algorithms in the literature can be properly defined as variable-rate servers. We develop techniques to analyze delay and fairness properties of variable-rate and hierarchical PFQ servers. We demonstrate that in order to provide tight delay bounds with an H-PFQ server, it is essential for the one-level PFQ servers to have small worst-case fair indices (WFI). We propose a new PFQ algorithm called WF/sup 2/Q+ that is the first to have all the following three properties: (1) providing the tightest delay bound among all PFQ algorithms; (2) having the smallest WFI among all PFQ algorithms; and (3) having a relatively low asymptotic complexity of O(log N). Simulation results are presented to evaluate the delay and link-sharing properties of H-WF/sup 2/Q+, H-WFQ, H-SFQ, and H-SCFQ.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Parekh, A. K., & Gallager, R. G. (1993) · IEEE/ACM Transactions on Networking · doi:10.1109/90.234856 · Cited by 3,705
Analysis and simulation of a fair queueing algorithm
Demers, A., Keshav, S., & Shenker, S. (1989) · ACM SIGCOMM Computer Communication Review · doi:10.1145/75247.75248 · Cited by 2,614
Analysis and simulation of a fair queueing algorithm
Demers, A., Keshav, S., & Shenker, S. (1989) · Symposium proceedings on Communications architectures & protocols · doi:10.1145/75246.75248 · Cited by 1,729
Efficient fair queuing using deficit round-robin
Shreedhar, M., & Varghese, G. (1996) · IEEE/ACM Transactions on Networking · doi:10.1109/90.502236 · Cited by 1,399
A self-clocked fair queueing scheme for broadband applications
Golestani, S. J. (2002) · Proceedings of INFOCOM '94 Conference on Computer Communications · doi:10.1109/infcom.1994.337677 · Cited by 1,100
Link-sharing and resource management models for packet networks
Floyd, S., & Jacobson, V. (1995) · IEEE/ACM Transactions on Networking · doi:10.1109/90.413212 · Cited by 977
Clark, D. D., Shenker, S., & Zhang, L. (1992) · Conference proceedings on Communications architectures & protocols - SIGCOMM '92 · doi:10.1145/144179.144199 · Cited by 851
A control-theoretic approach to flow control
Keshav, S. (1991) · Proceedings of the conference on Communications architecture & protocols · doi:10.1145/115992.115995 · Cited by 752
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
Goyal, P., Vin, H. M., & Chen, H. (1996) · Conference proceedings on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/248156.248171 · Cited by 442
Efficient fair queueing using deficit round robin
Shreedhar, M., & Varghese, G. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/217391.217453 · Cited by 347
Cited by
Survey on Network Virtualization Hypervisors for Software Defined Networking
Blenk, A., Basta, A., Reisslein, M., & Kellerer, W. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2489183 · Cited by 295
Proportional differentiated services: delay differentiation and packet scheduling
Dovrolis, C., Stiliadis, D., & Ramanathan, P. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316211 · Cited by 265
Metadata
- Authors
- Bennett, J. C. R., & Zhang, H.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 1997
- Volume
- 5
- Issue
- 5
- Pages
- 675-689
- ISSN
- 1063-6692 (ISSN-L)
- OpenAlex
- W2058819785
- Cited by
- 422
- References
- 13
- FWCI
- 21.57
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Hierarchical packet fair queueing algorithms. https://app.cochat.ai/papers/10.1109/90.649568
- The paper
- Bennett, J. C. R., & Zhang, H. (1997). Hierarchical packet fair queueing algorithms. IEEE/ACM Transactions on Networking. https://doi.org/10.1109/90.649568
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.