The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Binomial congestion control algorithms
Abstract
This paper introduces and analyzes a class of nonlinear congestion control algorithms called binomial algorithms, motivated in part by the needs of streaming audio and video applications for which a drastic reduction in transmission rate upon each congestion indication (or loss) is problematic. Binomial algorithms generalize TCP-style additive-increase by increasing inversely proportional to a power k of the current window (for TCP, k=0); they generalize TCP-style multiplicative decrease by decreasing proportional to a power l of the current window (for TCP, l=1). We show that there are an infinite number of deployable TCP-compatible binomial algorithms, those which satisfy k+1=1, and that all binomial algorithms converge to fairness under a synchronized-feedback assumption provided k+l>0; k, l/spl ges/0. Our simulation results show that binomial algorithms interact well with TCP across a RED gateway. We focus on two particular algorithms, IIAD (k=1, l=0) and SQRT (k=l=0.5), showing that they are well-suited to applications that do not react well to large TCP-style window reductions.
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
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
RTP: A Transport Protocol for Real-Time Applications
Schulzrinne, H., Casner, S., Frederick, R., & Jacobson, V. (2003) · doi:10.17487/rfc3550 · Cited by 5,776
Congestion avoidance and control
Jacobson, V. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205462 · Cited by 5,301
(2011) · SpringerReference · doi:10.1007/springerreference_27387 · Cited by 3,053
Allman, M., Paxson, V., & Blanton, E. (2009) · doi:10.17487/rfc5681 · Cited by 2,523
Congestion avoidance and control
Jacobson, V. (1988) · Symposium proceedings on Communications architectures and protocols · doi:10.1145/52324.52356 · Cited by 2,479
The Art of Computer Systems Performance Analysis.
Jain, R. (1990) · Int. CMG Conference · Cited by 2,280
Postel, J. (1981) · doi:10.17487/rfc0793 · Cited by 2,122
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
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
Promoting the use of end-to-end congestion control in the Internet
Floyd, S., & Fall, K. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.793002 · Cited by 1,646
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
Recommendations on Queue Management and Congestion Avoidance in the Internet
Braden, B., Clark, D., Crowcroft, J., Davie, B., Deering, S., Estrin, D., Floyd, S., Jacobson, V., Minshall, G., Partridge, C., et al. (1998) · doi:10.17487/rfc2309 · Cited by 1,318
RTP: A Transport Protocol for Real-Time Applications
Audio-Video Transport Working Group, Schulzrinne, H., Casner, S., Frederick, R., & Jacobson, V. (1996) · doi:10.17487/rfc1889 · Cited by 1,297
TCP Vegas: new techniques for congestion detection and avoidance
Brakmo, L. S., O'Malley, S. W., & Peterson, L. L. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/190809.190317 · Cited by 1,198
Receiver-driven layered multicast
McCanne, S., Jacobson, V., & Vetterli, M. (1996) · Conference proceedings on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/248156.248168 · Cited by 1,195
TCP Selective Acknowledgment Options
Mathis, M., Mahdavi, J., Floyd, S., & Romanow, A. (1996) · doi:10.17487/rfc2018 · Cited by 972
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
Clark, D. D., Shenker, S., & Zhang, L. (1992) · Conference proceedings on Communications architectures & protocols - SIGCOMM '92 · doi:10.1145/144179.144199 · Cited by 851
Modeling TCP throughput: a simple model and its empirical validation
Padhye, J., Firoiu, V., Towsley, D., & Kurose, J. (1998) · ACM SIGCOMM Computer Communication Review · doi:10.1145/285243.285291 · Cited by 716
RAP: 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
TCP Vegas: new techniques for congestion detection and avoidance
Brakmo, L. S., O'Malley, S. W., & Peterson, L. L. (1994) · Proceedings of the conference on Communications architectures, protocols and applications - SIGCOMM '94 · doi:10.1145/190314.190317 · Cited by 698
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
An integrated congestion management architecture for Internet hosts
Balakrishnan, H., Rahul, H. S., & Seshan, S. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316220 · Cited by 341
Self-citationForward acknowledgement: refining TCP congestion control
Mathis, M., & Mahdavi, J. (1996) · Conference proceedings on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/248156.248181 · Cited by 228
Forward acknowledgement: refining TCP congestion control
Mathis, M., & Mahdavi, J. (1996) · ACM SIGCOMM Computer Communication Review · doi:10.1145/248157.248181 · Cited by 118
An integrated congestion management architecture for Internet hosts
Balakrishnan, H., Rahul, H. S., & Seshan, S. (1999) · ACM SIGCOMM Computer Communication Review · doi:10.1145/316194.316220 · Cited by 103
Self-citationA class of end-to-end congestion control algorithms for the Internet
Golestani, S. J., & Bhattacharyya, S. (2002) · IEEE International Conference on Network Protocols (ICNP) · doi:10.1109/icnp.1998.723734 · Cited by 91
System support for bandwidth management and content adaptation in internet applications
Andersen, D. G., Bansal, D., Curtis, D. W., Seshan, S., & Balakrishnan, H. (2000) · DSpace@MIT (Massachusetts Institute of Technology) · doi:10.5555/1251229.1251244 · Cited by 78
Self-citationTCP-friendly Congestion Control for Real-time Streaming Applications
Bansal, D., & Balakrishnan, H. (2000) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 69
Self-citation
Cited by
Congestion control for high bandwidth-delay product networks
Katabi, D., Handley, M., & Rohrs, C. (2002) · Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/633025.633035 · Cited by 1,096
A duality model of TCP and queue management algorithms
Low, S. H. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.815297 · Cited by 653
A 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
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
Self-citation
Metadata
- Authors
- Bansal, D., & Balakrishnan, H.
- Venue
- Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213)
- Publisher
- IEEE
- Published
- 2002-11-13
- Volume
- 2
- Pages
- 631-640
- OpenAlex
- W2100948257
- Cited by
- 363
- References
- 30
- FWCI
- 31.70
- 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
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.