The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Binary increase congestion control (BIC) for fast long-distance networks
Abstract
High-speed networks with large delays present a unique environment where TCP may have a problem utilizing the full bandwidth. Several congestion control proposals have been suggested to remedy this problem. The existing protocols consider mainly two properties: TCP friendliness and bandwidth scalability. That is, a protocol should not take away too much bandwidth from standard TCP flows while utilizing the full bandwidth of high-speed networks. This work presents another important constraint, namely, RTT (round trip time) unfairness where competing flows with different RTTs may consume vastly unfair bandwidth shares. Existing schemes have a severe RTT unfairness problem because the congestion window increase rate gets larger as the window grows ironically the very reason that makes them more scalable. RTT unfairness for high-speed networks occurs distinctly with drop tail routers for flows with large congestion windows where packet loss can be highly synchronized. After identifying the RTT unfairness problem of existing protocols, This work presents a new congestion control scheme that alleviates RTT unfairness while supporting TCP friendliness and bandwidth scalability. The proposed congestion control algorithm uses two window size control policies called additive increase and binary search increase. When the congestion window is large, additive increase with a large increment ensures square RTT unfairness as well as good scalability. Under small congestion windows, binary search increase supports TCP friendliness. The simulation results confirm these properties of the protocol.
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
Cites
Corless, R. M., Gonnet, G. H., Hare, D. E. G., Jeffrey, D. J., & Knuth, D. E. (1996) · Advances in Computational Mathematics · doi:10.1007/bf02124750 · Cited by 6,150
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
HighSpeed TCP for Large Congestion Windows
Floyd, S. (2003) · doi:10.17487/rfc3649 · Cited by 1,165
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
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
End-to-end available bandwidth: Measurement methodology, dynamics, and relation with TCP throughput
Jain, M., & Dovrolis, C. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.815304 · Cited by 770
Semke, J., Mahdavi, J., & Mathis, M. (1998) · Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/285237.285292 · Cited by 253
Sivakumar, H., Bailey, S. N., & Grossman, R. L. (2000) · Conference on High Performance Computing (Supercomputing) · doi:10.5555/370049.370413 · Cited by 237
A Comparison of Equation-Based and AIMD Congestion Control
Floyd, S., Handley, M. J., & Padhye, J. (2000) · Cited by 170
Limited Slow-Start for TCP with Large Congestion Windows
Floyd, S. (2004) · doi:10.17487/rfc3742 · Cited by 143
Cited by
CUBIC: a new TCP-friendly high-speed TCP variant
Ha, S., Rhee, I., & Xu, L. (2008) · ACM SIGOPS Operating Systems Review · doi:10.1145/1400097.1400105 · Cited by 2,287
Self-citationUDT: 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
TCP 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
Metadata
- Authors
- Xu, L., Harfoush, K., & Rhee, I.
- Venue
- IEEE INFOCOM 2004
- Publisher
- IEEE
- Published
- 2005-02-22
- Volume
- 4
- Pages
- 2514-2524
- OpenAlex
- W2100166367
- Cited by
- 959
- References
- 13
- FWCI
- 53.51
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Binary increase congestion control (BIC) for fast long-distance networks. https://app.cochat.ai/papers/10.1109/infcom.2004.1354672
- The paper
- Xu, L., Harfoush, K., & Rhee, I. (2005). Binary increase congestion control (BIC) for fast long-distance networks. IEEE INFOCOM 2004. https://doi.org/10.1109/infcom.2004.1354672
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.