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
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
Making middleboxes someone else's problem: network processing as a cloud service
Sherry, J., Hasan, S., Scott, C., Krishnamurthy, A., Ratnasamy, S., & Sekar, V. (2012) · Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/2342356.2342359 · Cited by 621
The Globus Striped GridFTP Framework and Server
Allcock, W., Bresnahan, J., Kettimuthu, R., & Link, M. (2005) · ACM/IEEE SC 2005 Conference (SC'05) · doi:10.1109/sc.2005.72 · Cited by 601
Better never than late: meeting deadlines in datacenter networks
Wilson, C., Ballani, H., Karagiannis, T., & Rowtron, A. (2011) · Proceedings of the ACM SIGCOMM 2011 conference · doi:10.1145/2018436.2018443 · Cited by 579
A case for stateful forwarding plane
Yi, C., Afanasyev, A., Moiseenko, I., Wang, L., Zhang, B., & Zhang, L. (2013) · Computer Communications · doi:10.1016/j.comcom.2013.01.005 · Cited by 474
Deadline-aware datacenter tcp (D2TCP)
Vamanan, B., Hasan, J., & Vijaykumar, T. N. (2012) · Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/2342356.2342388 · Cited by 473
Finishing flows quickly with preemptive scheduling
Hong, C.-Y., Caesar, M., & Godfrey, P. B. (2012) · Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/2342356.2342389 · Cited by 451
TIMELY: RTT-based Congestion Control for the Datacenter
Mittal, R., Lam, V. T., Dukkipati, N., Blem, E., Wassel, H., Ghobadi, M., Vahdat, A., Wang, Y., Wetherall, D., & Zats, D. (2015) · Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication · doi:10.1145/2785956.2787510 · Cited by 448
UDT: UDP-based data transfer for high-speed wide area networks
Gu, Y., & Grossman, R. L. (2007) · Computer Networks · doi:10.1016/j.comnet.2006.11.009 · Cited by 414
Walking the tightrope: responsive yet stable traffic engineering
Kandula, S., Katabi, D., Davie, B., & Charny, A. (2005) · Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1080091.1080122 · Cited by 352
Self-citationTCP ex machina: computer-generated congestion control
Winstein, K., & Balakrishnan, H. (2013) · Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM · doi:10.1145/2486001.2486020 · Cited by 332
Sharing the data center network
Shieh, A., Kandula, S., Greenberg, A. G., Kim, C., & Saha, B. (2011) · doi:10.5555/1972457.1972489 · Cited by 322
Why flow-completion time is the right metric for congestion control
Dukkipati, N., & McKeown, N. (2006) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1111322.1111336 · Cited by 317
A survey of secure mobile Ad Hoc routing protocols
Abusalah, L., Khokhar, A., & Guizani, M. (2008) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2008.080405 · Cited by 311
Adaptive forwarding in named data networking
Yi, C., Afanasyev, A., Wang, L., Zhang, B., & Zhang, L. (2012) · ACM SIGCOMM Computer Communication Review · doi:10.1145/2317307.2317319 · Cited by 308
Alternative Distributed Algorithms for Network Utility Maximization: Framework and Applications
Palomar, D. P., & Chiang, M. (2007) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2007.910665 · Cited by 294
Active Queue Management: A Survey
Adams, R. (2013) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2012.082212.00018 · Cited by 283
Participatory networking: an API for application control of SDNs
Ferguson, A. D., Guha, A., Liang, C., Fonseca, R., & Krishnamurthi, S. (2013) · Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM · doi:10.1145/2486001.2486003 · Cited by 269
PINT: Probabilistic In-band Network Telemetry
Ben Basat, R., Ramanathan, S., Li, Y., Antichi, G., Yu, M., & Mitzenmacher, M. (2020) · Proceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication · doi:10.1145/3387514.3405894 · Cited by 268
TCP-Illinois: A loss- and delay-based congestion control algorithm for high-speed networks
Liu, S., Başar, T., & Srikant, R. (2008) · Performance Evaluation · doi:10.1016/j.peva.2007.12.007 · Cited by 259
Classic Meets Modern: a Pragmatic Learning-Based Congestion Control for the Internet
Abbasloo, S., Yen, C.-Y., & Chao, H. J. (2020) · Proceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication · doi:10.1145/3387514.3405892 · Cited by 255
A novel learning based solution for efficient data transport in heterogeneous wireless networks
Badarla, V., & Siva Ram Murthy, C. (2010) · Wireless Networks · doi:10.1007/s11276-009-0228-4 · Cited by 6
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.