The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Promoting the use of end-to-end congestion control in the Internet
Abstract
This paper considers the potentially negative impacts of an increasing deployment of non-congestion-controlled best-effort traffic on the Internet. These negative impacts range from extreme unfairness against competing TCP traffic to the potential for congestion collapse. To promote the inclusion of end-to-end congestion control in the design of future protocols using best-effort traffic, we argue that router mechanisms are needed to identify and restrict the bandwidth of selected high-bandwidth best-effort flows in times of congestion. The paper discusses several general approaches for identifying those flows suitable for bandwidth regulation. These approaches are to identify a high-bandwidth flow in times of congestion as unresponsive, "not TCP-friendly", or simply using disproportionate bandwidth. A flow that is not "TCP-friendly" is one whose long-term arrival rate exceeds that of any conformant TCP in the same circumstances. An unresponsive flow is one failing to reduce its offered load at a router in response to an increased packet drop rate, and a disproportionate-bandwidth flow is one that uses considerably more bandwidth than other flows in a time of congestion.
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
Axelrod, R., & Hamilton, W. D. (1981) · Science · doi:10.1126/science.7466396 · Cited by 20,065
Random early detection gateways for congestion avoidance
Floyd, S., & Jacobson, V. (1993) · IEEE/ACM Transactions on Networking · doi:10.1109/90.251892 · Cited by 6,290
Self-citationCongestion avoidance and control
Jacobson, V. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205462 · Cited by 5,301
Security Architecture for the Internet Protocol
Atkinson, R. (1995) · doi:10.17487/rfc1825 · Cited by 2,762
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
Modeling TCP throughput: a simple model and its empirical validation
Padhye, J., Firoiu, V., Towsley, D., & Kurose, J. (1998) · Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/285237.285291 · Cited by 2,106
Congestion avoidance and control
Jacobson, V. (1988) · ACM SIGCOMM Computer Communication Review · doi:10.1145/52325.52356 · Cited by 1,955
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
The macroscopic behavior of the TCP congestion avoidance algorithm
Mathis, M., Semke, J., Mahdavi, J., & Ott, T. (1997) · ACM SIGCOMM Computer Communication Review · doi:10.1145/263932.264023 · Cited by 1,495
Rider, R. (1984) · Journal of Economic Behavior & Organization · doi:10.1016/0167-2681(84)90012-x · Cited by 1,472
Cited by
Allman, M., Paxson, V., & Blanton, E. (2009) · doi:10.17487/rfc5681 · Cited by 2,523
Equation-based congestion control for unicast applications
Floyd, S., Handley, M., Padhye, J., & Widmer, J. (2000) · ACM SIGCOMM Computer Communication Review · doi:10.1145/347057.347397 · Cited by 1,414
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-citationRAP: An end-to-end rate-based congestion control mechanism for realtime streams in the Internet
Rejaie, R., Handley, M., & Estrin, D. (1999) · IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320) · doi:10.1109/infcom.1999.752152 · Cited by 710
Streaming video over the Internet: approaches and directions
Wu, D., Hou, Y. T., Zhu, W., Zhang, Y.-Q., & Peha, J. M. (2001) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/76.911156 · Cited by 710
Equation-based congestion control for unicast applications
Floyd, S., Handley, M., Padhye, J., & Widmer, J. (2000) · Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication · doi:10.1145/347059.347397 · Cited by 587
Self-citationA Compound TCP Approach for High-Speed and Long Distance Networks
Tan, K., Song, J., Zhang, Q., & Sridharan, M. (2006) · Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications · doi:10.1109/infocom.2006.188 · Cited by 584
Resource pricing and the evolution of congestion control
Gibbens, R. J., & Kelly, F. P. (1999) · Automatica · doi:10.1016/s0005-1098(99)00135-1 · Cited by 544
TCP Veno: TCP enhancement for transmission over wireless access networks
Fu, C. P., & Liew, S. C. (2003) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.807336 · Cited by 536
Cardwell, N., Savage, S., & Anderson, T. (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.832574 · Cited by 472
End-to-end congestion control schemes: utility functions, random losses and ecn marks
Kunniyur, S., & Srikant, R. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.818183 · Cited by 448
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
Versatile, scalable, and accurate simulation of distributed applications and platforms
Casanova, H., Giersch, A., Legrand, A., Quinson, M., & Suter, F. (2014) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2014.06.008 · Cited by 415
Full TCP/IP for 8-bit architectures
Dunkels, A. (2003) · Proceedings of the 1st international conference on Mobile systems, applications and services · doi:10.1145/1066116.1066118 · Cited by 396
Analytic evaluation of RED performance
Bonald, T., May, M., & Bolot, J.-C. (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.832539 · Cited by 405
Enhancing TCP Over Satellite Channels using Standard Mechanisms
Allman, M., Glover, D., & Sanchez, L. (1999) · doi:10.17487/rfc2488 · Cited by 382
General AIMD congestion control
Yang, Y. R., & Lam, S. S. (2002) · Proceedings 2000 International Conference on Network Protocols · doi:10.1109/icnp.2000.896303 · Cited by 370
Binomial congestion control algorithms
Bansal, D., & Balakrishnan, H. (2002) · Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213) · doi:10.1109/infcom.2001.916251 · Cited by 363
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
Self-citationSharing the data center network
Shieh, A., Kandula, S., Greenberg, A. G., Kim, C., & Saha, B. (2011) · doi:10.5555/1972457.1972489 · Cited by 322
TCP-Peach: a new congestion control scheme for satellite IP networks
Akyildiz, I. F., Morabito, G., & Palazzo, S. (2001) · IEEE/ACM Transactions on Networking · doi:10.1109/90.929853 · Cited by 302
Performance evaluation and comparison of Westwood+, New Reno, and Vegas TCP congestion control
Grieco, L. A., & Mascolo, S. (2004) · ACM SIGCOMM Computer Communication Review · doi:10.1145/997150.997155 · Cited by 293
Passive estimation of TCP round-trip times
Jiang, H., & Dovrolis, C. (2002) · ACM SIGCOMM Computer Communication Review · doi:10.1145/571697.571725 · Cited by 291
Floyd, S. (2000) · doi:10.17487/rfc2914 · Cited by 287
Self-citationOngoing TCP Research Related to Satellites
Dawkins, S., Glover, D., Griner, J., Tran, D., Henderson, T., Heidemann, J., Touch, J., Kruse, H., Ostermann, S., Scott, K., et al. (2000) · doi:10.17487/rfc2760 · Cited by 284
Host-to-Host Congestion Control for TCP
Afanasyev, A., Tilley, N., Reiher, P., & Kleinrock, L. (2010) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2010.042710.00114 · Cited by 278
On making TCP more robust to packet reordering
Blanton, E., & Allman, M. (2002) · ACM SIGCOMM Computer Communication Review · doi:10.1145/510726.510728 · Cited by 257
An adaptive AQM algorithm based on neuron reinforcement learning
Zhou, C., Di, D., Chen, Q., & Guo, J. (2009) · 2009 IEEE International Conference on Control and Automation · doi:10.1109/icca.2009.5410198 · Cited by 17
Machine-learnt versus analytical models of TCP throughput
El Khayat, I., Geurts, P., & Leduc, G. (2007) · Computer Networks · doi:10.1016/j.comnet.2006.11.017 · Cited by 10
Metadata
- Authors
- Floyd, S., & Fall, K.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 1999
- Volume
- 7
- Issue
- 4
- Pages
- 458-472
- ISSN
- 1063-6692 (ISSN-L)
- OpenAlex
- W2126880366
- Cited by
- 1,646
- References
- 30
- FWCI
- 169.79
- 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
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.