Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 422

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

Bennett, J.C.R., Hui Zhang·1997·IEEE/ACM Transactions on Networking

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/90.649568

Cites

13 of 13 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 13 references

Cited by

See all 422

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.