The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Congestion control for high bandwidth-delay product networks
Open accessAbstract
Theory and experiments show that as the per-flow product of bandwidth and latency increases, TCP becomes inefficient and prone to instability, regardless of the queuing scheme. This failing becomes increasingly important as the Internet evolves to incorporate very high-bandwidth optical links and more large-delay satellite links.To address this problem, we develop a novel approach to Internet congestion control that outperforms TCP in conventional environments, and remains efficient, fair, scalable, and stable as the bandwidth-delay product increases. This new eXplicit Control Protocol, XCP, generalizes the Explicit Congestion Notification proposal (ECN). In addition, XCP introduces the new concept of decoupling utilization control from fairness control. This allows a more flexible and analytically tractable protocol design and opens new avenues for service differentiation.Using a control theory framework, we model XCP and demonstrate it is stable and efficient regardless of the link capacity, the round trip delay, and the number of sources. Extensive packet-level simulations show that XCP outperforms TCP in both conventional and high bandwidth-delay environments. Further, XCP achieves fair bandwidth allocation, high utilization, small standing queue size, and near-zero packet drops, with both steady and highly varying traffic. Additionally, the new protocol does not maintain any per-flow state in routers and requires few CPU cycles per packet, which makes it implementable in high-speed routers.
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
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 · cited 1×
“This new eXplicit Control Protocol, XCP, generalizes the Explicit Congestion Noti.cation proposal (ECN).”
Congestion avoidance and control
Jacobson, V. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205462 · Cited by 5,301
Rate control for communication networks: shadow prices, proportional fairness and stability
Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2600523 · Cited by 5,021
Self-similarity in World Wide Web traffic: evidence and possible causes
Crovella, M. E., & Bestavros, A. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.650143 · Cited by 2,731
Congestion avoidance and control
Jacobson, V. (1988) · Symposium proceedings on Communications architectures and protocols · doi:10.1145/52324.52356 · Cited by 2,479
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Chiu, D.-M., & Jain, R. (1989) · Computer Networks and ISDN Systems · doi:10.1016/0169-7552(89)90019-6 · Cited by 1,902
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-citationFluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED
Misra, V., Gong, W.-B., & Towsley, D. (2000) · ACM SIGCOMM Computer Communication Review · doi:10.1145/347057.347421 · Cited by 1,274
Athuraliya, S., Low, S. H., Li, V. H., & Yin, Q. (2001) · IEEE Network · doi:10.1109/65.923940 · Cited by 1,011
On designing improved controllers for AQM routers supporting TCP flows
Hollot, C. V., Misra, V., Towsley, D., & Gong, W.-B. (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.916670 · Cited by 958
A Proposal to add Explicit Congestion Notification (ECN) to IP
Ramakrishnan, K., & Floyd, S. (1999) · doi:10.17487/rfc2481 · Cited by 735
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-citationStoica, I. G., Shenker, S. J., & Zhang, H. (1998) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/285237.285273 · Cited by 510
Analysis and design of an adaptive virtual queue (AVQ) algorithm for active queue management
Kunniyur, S., & Srikant, R. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383069 · Cited by 490
Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED
Misra, V., Gong, W.-B., & Towsley, D. (2000) · Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication · doi:10.1145/347059.347421 · Cited by 427
Enhancing TCP Over Satellite Channels using Standard Mechanisms
Allman, M., Glover, D., & Sanchez, L. (1999) · doi:10.17487/rfc2488 · Cited by 382
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
Scalable laws for stable network congestion control
Paganini, F., Doyle, J., & Low, S. (2003) · Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228) · doi:10.1109/cdc.2001.980095 · Cited by 276
Internet Congestion Control for Future High Bandwidth-Delay Product Environments
Katabi, D., Handley, M. J., & Rohrs, C. (2013) · Cited by 138
Self-citationAn Algorithm for Rate Allocation in a Packet-Switching Network With Feedback
Charny, A. (1994) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 119
Montenegro, G., Dawkins, S., Kojo, M., Magret, V., & Vaidya, N. H. (2000) · doi:10.17487/rfc2757 · Cited by 94
Cited by
Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures
Chiang, M., Low, S. H., Calderbank, A. R., & Doyle, J. C. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887322 · Cited by 1,352
FAST TCP: Motivation, Architecture, Algorithms, Performance
Wei, D. X., Jin, C., Low, S. H., & Hegde, S. (2006) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2006.886335 · Cited by 955
Scalable TCP: improving performance in highspeed wide area networks
Kelly, T. (2003) · ACM SIGCOMM Computer Communication Review · doi:10.1145/956981.956989 · Cited by 869
The Akamai network: a platform for high-performance internet applications
Nygren, E., Sitaraman, R. K., & Sun, J. (2010) · ACM SIGOPS Operating Systems Review · doi:10.1145/1842733.1842736 · Cited by 726
FAST TCP: motivation, architecture, algorithms, performance
Jin, C., Wei, D. X., & Low, S. H. (2005) · IEEE INFOCOM 2004 · doi:10.1109/infcom.2004.1354670 · Cited by 625
Metadata
- Authors
- Katabi, D., Handley, M., & Rohrs, C.
- Venue
- Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
- Publisher
- ACM
- Published
- 2002-08-19
- Pages
- 89-102
- OpenAlex
- W2103701891
- Cited by
- 1,096
- References
- 21
- FWCI
- 31.70
- Type
- conference paper
- Language
- en
- Open access
- bronze
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.