The DOI matches its Crossref record.
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.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cited by
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
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
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
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
- 0
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Congestion control for high bandwidth-delay product networks. https://app.cochat.ai/papers/10.1145/633025.633035
- The paper
- Katabi, D., Handley, M., & Rohrs, C. (2002). Congestion control for high bandwidth-delay product networks. Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications. https://doi.org/10.1145/633025.633035
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.