The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Fair end-to-end window-based congestion control
Abstract
In this paper, we demonstrate the existence of fair end-to-end window-based congestion control protocols for packet-switched networks with first come-first served routers. Our definition of fairness generalizes proportional fairness and includes arbitrarily close approximations of max-min fairness. The protocols use only information that is available to end hosts and are designed to converge reasonably fast. Our study is based on a multiclass fluid model of the network. The convergence of the protocols is proved using a Lyapunov function. The technical challenge is in the practical implementation of the protocols.
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
Bertsekas, D. P., & Gallager, R. G. (1987) · Cited by 5,561
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
Charging and rate control for elastic traffic
Kelly, F. (1997) · European Transactions on Telecommunications · doi:10.1002/ett.4460080106 · Cited by 2,936
Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
Rosen, J. B. (1965) · Econometrica · doi:10.2307/1911749 · Cited by 2,686
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.1038/sj.jors.2600523 · Cited by 2,399
Congestion avoidance and control
Jacobson, V. (1988) · ACM SIGCOMM Computer Communication Review · doi:10.1145/52325.52356 · Cited by 1,955
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
Introduction to dynamic systems
(2016) · Structural Dynamics · doi:10.1201/9781315375311-5 · Cited by 567
Jaffe, J. (1981) · IEEE Transactions on Communications · doi:10.1109/tcom.1981.1095081 · Cited by 455
Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic
Floyd, S. (1991) · ACM SIGCOMM Computer Communication Review · doi:10.1145/122431.122434 · Cited by 382
Round-robin scheduling for max-min fairness in data networks
Hahne, E. L. (1991) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.103550 · Cited by 355
Traffic phase effects in packet-switched gateways
Floyd, S., & Jacobson, V. (1991) · ACM SIGCOMM Computer Communication Review · doi:10.1145/122419.122421 · Cited by 335
(1977) · Operations research handbook · doi:10.1515/9783111506975-011 · Cited by 176
An Algorithm for Rate Allocation in a Packet-Switching Network With Feedback
Charny, A. (1994) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 119
Avriel, M. (1976) · Cited by 115
Global fairness of additive-increase and multiplicative-decrease with heterogeneous round-trip times
Vojnović, M., Boudec, J. L., & Boutremans, C. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2000.832524 · Cited by 109
On improving the fairness of TCP congestion avoidance
Henderson, T. R., Sahouria, E., McCanne, S., & Katz, R. H. (2002) · Globecom · doi:10.1109/glocom.1998.775786 · Cited by 104
Random drop congestion control
Mankin, A. (1990) · ACM SIGCOMM Symposium on Communications Architectures and Protocols (SIGCOMM) · doi:10.1145/99508.99521 · Cited by 79
Myths about Congestion Management in High Speed NetworksPreprint
Jain, R. K. (1998) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/9809088 · Cited by 69
A Note on the Fairness of Additive Increase and Multiplicative Decrease
Hurley, P., Boudec, J. L., & Thiran, P. (1998) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 62
Cited by
Stochastic Network Optimization with Application to Communication and Queueing Systems
Neely, M. J. (2010) · Synthesis lectures on communication networks · doi:10.2200/s00271ed1v01y201006cnt007 · Cited by 2,218
Massive MIMO Networks: Spectral, Energy, and Hardware Efficiency
Björnson, E., Hoydis, J., & Sanguinetti, L. (2017) · Foundations and Trends® in Signal Processing · doi:10.1561/2000000093 · Cited by 2,137
Nonorthogonal Multiple Access for 5G and Beyond
Liu, Y., Qin, Z., Elkashlan, M., Ding, Z., Nallanathan, A., & Hanzo, L. (2017) · Proceedings of the IEEE · doi:10.1109/jproc.2017.2768666 · Cited by 1,369
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
Metadata
- Authors
- Mo, J., & Walrand, J.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2000
- Volume
- 8
- Issue
- 5
- Pages
- 556-567
- ISSN
- 1063-6692 (ISSN-L)
- OpenAlex
- W2147524058
- Cited by
- 2,095
- References
- 22
- FWCI
- 39.24
- Type
- journal article
- 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.