The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
General AIMD congestion control
Abstract
Instead of the increase-by-one decrease-to-half strategy used in TCP for congestion window adjustment, we consider the general case such that the increase value and decrease ratio are parameters. That is, in the congestion avoidance state, the window size is increased by /spl alpha/ per window of packets acknowledged and it is decreased to /spl beta/ of the current value when there is congestion indication. We refer to this window adjustment strategy as general additive increase multiplicative decrease (GAIMD). We present the (mean) sending rate of a GAIMD flow as a function of /spl alpha/, /spl beta/, loss rate, mean round-trip time, mean timeout value, and the number of packets acknowledged by each ACK. We conducted extensive experiments to validate this sending rate formula. We found the formula to be quite accurate for a loss rate of up to 20%. We also present a simple relationship between /spl alpha/ and /spl beta/ for a GAIMD flow to be TCP-friendly, that is, for the GAIMD flow to have approximately the same sending rate as a TCP flow under the same path conditions. We present results from simulations in which TCP-friendly GAIMD flows (/spl alpha/=0.31, /spl beta/=7/8) compete for bandwidth with TCP Reno flows and with TCP SACK flows, on a DropTail link as well as on a RED link. We found that the GAIMD flows were highly, TCP-friendly. Furthermore, with /spl beta/ at 7/8 instead of 1/2, these GAIMD flows have reduced rate fluctuations compared to TCP flows.
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
Congestion avoidance and control
Jacobson, V. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205462 · Cited by 5,301
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
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
Willinger, W., Taqqu, M. S., Sherman, R., & Wilson, D. V. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.554723 · Cited by 1,654
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
The macroscopic behavior of the TCP congestion avoidance algorithm
Mathis, M., Semke, J., Mahdavi, J., & Ott, T. (1997) · ACM SIGCOMM Computer Communication Review · doi:10.1145/263932.264023 · Cited by 1,495
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
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
Cited by
ATL: An Adaptive Transport Layer Suite for Next-Generation Wireless Internet
Akan, O. B., & Akyildiz, I. F. (2004) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2004.826919 · Cited by 75
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
- Yang, Y. R., & Lam, S. S.
- Venue
- Proceedings 2000 International Conference on Network Protocols
- Publisher
- IEEE Comput. Soc
- Published
- 2002-11-11
- Pages
- 187-198
- ISSN
- 1092-1648 (ISSN-L)
- OpenAlex
- W2133638675
- Cited by
- 370
- References
- 25
- FWCI
- 22.43
- 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: General AIMD congestion control. https://app.cochat.ai/papers/10.1109/icnp.2000.896303
- The paper
- Yang, Y. R., & Lam, S. S. (2002). General AIMD congestion control. Proceedings 2000 International Conference on Network Protocols. https://doi.org/10.1109/icnp.2000.896303
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.