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
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-citationReceiver-driven layered multicast
McCanne, S., Jacobson, V., & Vetterli, M. (1996) · Conference proceedings on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/248156.248168 · Cited by 1,195
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
Fundamental design issues for the future Internet
Shenker, S. (1995) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.414637 · Cited by 1,097
Self-citationDominant resource fairness: fair allocation of multiple resource types
Ghodsi, A., Zaharia, M., Hindman, B., Konwinski, A., Shenker, S. J., & Stoica, I. G. (2011) · doi:10.5555/1972457.1972490 · Cited by 1,049
Self-citationLink-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
The performance of TCP/IP for networks with high bandwidth-delay products and random loss
Lakshman, T. V., & Madhow, U. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.611099 · Cited by 928
High-speed switch scheduling for local-area networks
Anderson, T. E., Owicki, S. S., Saxe, J. B., & Thacker, C. P. (1993) · ACM Transactions on Computer Systems · doi:10.1145/161541.161736 · Cited by 892
Chen, S., & Nahrstedt, K. (1998) · IEEE Network · doi:10.1109/65.752646 · Cited by 874
Clark, D. D., Shenker, S., & Zhang, L. (1992) · Conference proceedings on Communications architectures & protocols - SIGCOMM '92 · doi:10.1145/144179.144199 · Cited by 851
Self-citationA 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
Self-citationControlling high bandwidth aggregates in the network
Mahajan, R., Bellovin, S. M., Floyd, S., Ioannidis, J., Paxson, V., & Shenker, S. (2002) · ACM SIGCOMM Computer Communication Review · doi:10.1145/571697.571724 · Cited by 742
Self-citationDifficulties in simulating the Internet
Floyd, S., & Paxson, V. (2001) · IEEE/ACM Transactions on Networking · doi:10.1109/90.944338 · Cited by 721
Improving fairness, efficiency, and stability in HTTP-based adaptive video streaming with FESTIVE
Jiang, J., Sekar, V., & Zhang, H. (2012) · Proceedings of the 8th international conference on Emerging networking experiments and technologies · doi:10.1145/2413176.2413189 · Cited by 688
Achieving MAC layer fairness in wireless packet networks
Nandagopal, T., Kim, T.-E., Gao, X., & Bharghavan, V. (2000) · Proceedings of the 6th annual international conference on Mobile computing and networking · doi:10.1145/345910.345925 · Cited by 659
Internet indirection infrastructure
Stoica, I., Adkins, D., Zhuang, S., Shenker, S., & Surana, S. (2002) · Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/633025.633033 · Cited by 642
Self-citationFair scheduling in wireless packet networks
Lu, S., Bharghavan, V., & Srikant, R. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.793003 · Cited by 638
Sparrow: distributed, low latency scheduling
Ousterhout, K., Wendell, P., Zaharia, M., & Stoica, I. (2013) · Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles · doi:10.1145/2517349.2522716 · Cited by 586
VirtualClock: a new traffic control algorithm for packet-switched networks
Zhang, L. (1991) · ACM Transactions on Computer Systems · doi:10.1145/103720.103721 · Cited by 509
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
Hierarchical packet fair queueing algorithms
Bennett, J. C. R., & Zhang, H. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.649568 · Cited by 422
CHOKe - a stateless active queue management scheme for approximating fair bandwidth allocation
Pan, R., Prabhakar, B., & Psounis, K. (2002) · Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064) · doi:10.1109/infcom.2000.832269 · Cited by 416
Matching output queueing with a combined input/output-queued switch
Chuang, S.-T., Goel, A., McKeown, N., & Prabhakar, B. (1999) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.772430 · Cited by 390
Improving Fairness, Efficiency, and Stability in HTTP-Based Adaptive Video Streaming With Festive
Jiang, J., Sekar, V., & Zhang, H. (2014) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2013.2291681 · Cited by 384
DeTail: reducing the flow completion time tail in datacenter networks
Zats, D., Das, T., Mohan, P., Borthakur, D., & Katz, R. (2012) · Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/2342356.2342390 · Cited by 383
Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic
Floyd, S. (1991) · ACM SIGCOMM Computer Communication Review · doi:10.1145/122431.122434 · Cited by 382
Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic
Zhang, L., Shenker, S., & Clark, D. D. (1991) · Proceedings of the conference on Communications architecture & protocols · doi:10.1145/115992.116006 · Cited by 375
Self-citationRound-robin scheduling for max-min fairness in data networks
Hahne, E. L. (1991) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.103550 · Cited by 355
A DoS-limiting network architecture
Yang, X., Wetherall, D., & Anderson, T. (2005) · Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1080091.1080120 · Cited by 340
Traffic phase effects in packet-switched gateways
Floyd, S., & Jacobson, V. (1991) · ACM SIGCOMM Computer Communication Review · doi:10.1145/122419.122421 · Cited by 335
Controlling high-bandwidth flows at the congested router
Mahajan, R., Floyd, S., & Wetherall, D. (2005) · Proceedings Ninth International Conference on Network Protocols. ICNP 2001 · doi:10.1109/icnp.2001.992899 · Cited by 335
A parameterizable methodology for Internet traffic flow profiling
Claffy, K. C., Braun, H.-W., & Polyzos, G. C. (1995) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.464717 · Cited by 330
Feedback control of congestion in packet switching networks: the case of a single congested node
Benmohamed, L., & Meerkov, S. M. (1993) · IEEE/ACM Transactions on Networking · doi:10.1109/90.266057 · Cited by 324
A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks
Jain, R. (1989) · ACM SIGCOMM Computer Communication Review · doi:10.1145/74681.74686 · Cited by 319
Ahn, G.-S., Campbell, A. T., Veres, A., & Sun, L.-H. (2002) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2002.1081755 · Cited by 283
Programmable Packet Scheduling at Line Rate
Sivaraman, A., Subramanian, S., Alizadeh, M., Chole, S., Chuang, S.-T., Agrawal, A., Balakrishnan, H., Edsall, T., Katti, S., & McKeown, N. (2016) · Proceedings of the 2016 ACM SIGCOMM Conference · doi:10.1145/2934872.2934899 · Cited by 276
McKenney, P. E. (2002) · Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration · doi:10.1109/infcom.1990.91316 · Cited by 273
The Design and Implementation of a Wireless Video Surveillance System
Zhang, T., Chowdhery, A., Bahl, P. (., Jamieson, K., & Banerjee, S. (2015) · Proceedings of the 21st Annual International Conference on Mobile Computing and Networking · doi:10.1145/2789168.2790123 · Cited by 272
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
Cake cutting: not just child's play
Procaccia, A. D. (2013) · Communications of the ACM · doi:10.1145/2483852.2483870 · Cited by 156
Ajtai, M., Aspnes, J., Naor, M., Rabani, Y., Schulman, L. J., & Waarts, O. (1998) · Journal of Algorithms · doi:10.1006/jagm.1998.0953 · Cited by 47
Locality-aware Fair Scheduling in LLM Serving
Cao, S., Wang, Y., Mao, Z., Hsu, P.-L., Yin, L., Xia, T., Li, D., Liu, S., Zhang, Y., Zhou, Y., et al. (2025) · arXiv · doi:10.48550/arxiv.2501.14312
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.