The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Analysis and simulation of a fair queueing algorithm
Abstract
We discuss gateway queueing algorithms and their role in controlling congestion in datagram networks. A fair queueing algorithm, based on an earlier suggestion by Nagle, is proposed. Analysis and simulations are used to compare this algorithm to other congestion control schemes. We find that fair queueing provides several important advantages over the usual first-come-first-serve queueing algorithm: fair allocation of bandwidth, lower delay for sources using less than their full share of bandwidth, and protection from ill-behaved sources.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Congestion avoidance and control
Jacobson, V. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205462 · Cited by 5,301
(2011) · SpringerReference · doi:10.1007/springerreference_27387 · Cited by 3,053
Congestion avoidance and control
Jacobson, V. (1988) · Symposium proceedings on Communications architectures and protocols · doi:10.1145/52324.52356 · Cited by 2,479
Postel, J. (1981) · doi:10.17487/rfc0793 · Cited by 2,122
Postel, J. B. (1981) · Cited by 1,130
Congestion control in IP/TCP internetworks
Nagle, J. (1984) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1024908.1024910 · Cited by 426
On Packet Switches with Infinite Storage
Nagle, J. (1987) · IEEE Transactions on Communications · doi:10.1109/tcom.1987.1096782 · Cited by 384
Improving round-trip time estimates in reliable transport protocols
Karn, P., & Partridge, C. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205455 · Cited by 323
A new architecture for packet switching network protocols
Zhang, L. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 192
Improving round-trip time estimates in reliable transport protocols
Karn, P., & Partridge, C. (1987) · doi:10.1145/55482.55484 · Cited by 83
Nest: A Network Simulation and Prototyping Tool.
Bacon, D. F., Schwartz, J., & Yemini, Y. (1988) · USENIX Winter · Cited by 16
Cited by
Parekh, A. K., & Gallager, R. G. (1993) · IEEE/ACM Transactions on Networking · doi:10.1109/90.234856 · Cited by 3,705
Promoting the use of end-to-end congestion control in the Internet
Floyd, S., & Fall, K. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.793002 · Cited by 1,646
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
Delay scheduling: a simple technique for achieving locality and fairness in cluster scheduling
Zaharia, M., Borthakur, D., Sen Sarma, J., Elmeleegy, K., Shenker, S., & Stoica, I. (2010) · Proceedings of the 5th European conference on Computer systems · doi:10.1145/1755913.1755940 · Cited by 1,393
Self-citationRecommendations on Queue Management and Congestion Avoidance in the Internet
Braden, B., Clark, D., Crowcroft, J., Davie, B., Deering, S., Estrin, D., Floyd, S., Jacobson, V., Minshall, G., Partridge, C., et al. (1998) · doi:10.17487/rfc2309 · Cited by 1,318
Self-citation
Metadata
- Authors
- Demers, A., Keshav, S., & Shenker, S.
- Venue
- Symposium proceedings on Communications architectures & protocols
- Publisher
- ACM
- Published
- 1989-08
- Pages
- 1-12
- OpenAlex
- W2073440460
- Cited by
- 1,729
- References
- 11
- FWCI
- 18.34
- Type
- conference paper
- 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
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.