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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
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
Stochastic Geometry and Wireless Networks: Volume I Theory
Baccelli, F. (2009) · now publishers, Inc. eBooks · doi:10.1561/9781601982650 · Cited by 867
A tutorial on cross-layer optimization in wireless networks
Lin, X., Shroff, N. B., & Srikant, R. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2006.879351 · Cited by 833
(2002) · IEEE Control Systems · doi:10.1109/37.980245 · Cited by 796
HIGUCHI, K., & BENJEBBOUR, A. (2015) · IEICE Transactions on Communications · doi:10.1587/transcom.e98.b.403 · Cited by 666
Bertsimas, D., Farias, V. F., & Trichakis, N. (2011) · Operations Research · doi:10.1287/opre.1100.0865 · Cited by 656
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
Xu, Y., Gui, G., Gacanin, H., & Adachi, F. (2021) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3059896 · Cited by 648
FAST TCP: motivation, architecture, algorithms, performance
Jin, C., Wei, D. X., & Low, S. H. (2005) · IEEE INFOCOM 2004 · doi:10.1109/infcom.2004.1354670 · Cited by 625
Chiang, M. (2005) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2004.837347(410 · Cited by 615
Energy Efficiency in Wireless Networks via Fractional Programming Theory
Zappone, A., & Jorswieck, E. (2015) · Foundations and Trends in Communications and Information Theory · doi:10.1561/0100000088 · Cited by 513
Stochastic Geometry and Wireless Networks: Volume I Theory
Baccelli, F., & Błaszczyszyn, B. (2010) · Foundations and Trends® in Networking · doi:10.1561/1300000006 · Cited by 497
Fair Resource Allocation in Federated Learning
Li, T., Sanjabi, M., Beirami, A., & Smith, V. (2019) · arXiv · doi:10.48550/arxiv.1905.10497 · Cited by 475
Resource allocation for spectrum underlay in cognitive radio networks
Le, L., & Hossain, E. (2008) · IEEE Transactions on Wireless Communications · doi:10.1109/t-wc.2008.070890 · Cited by 463
End-to-end congestion control schemes: utility functions, random losses and ecn marks
Kunniyur, S., & Srikant, R. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.818183 · Cited by 448
Fairness in wireless networks: Issues, measures and challenges
Shi, H., Prasad, R. V., Onur, E., & Niemegeers, I. G. M. M. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2013.050113.00015 · Cited by 446
Fei, Z., Li, B., Yang, S., Xing, C., Chen, H., & Hanzo, L. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2610578 · Cited by 433
Foundations of MIMO Communication
Heath Jr, R. W., & Lozano, A. (2018) · Cambridge University Press eBooks · doi:10.1017/9781139049276 · Cited by 426
Geometric Programming for Communication Systems
Chiang, M. (2005) · now publishers, Inc. eBooks · doi:10.1561/9781933019574 · Cited by 423
An Axiomatic Theory of Fairness in Network Resource Allocation
Lan, T., Kao, D., Chiang, M., & Sabharwal, A. (2010) · 2010 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2010.5461911 · Cited by 418
Joint congestion control, routing, and MAC for stability and fairness in wireless networks
Eryilmaz, A., & Srikant, R. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2006.879361 · Cited by 370
Power Control in Wireless Cellular Networks
Chiang, M., Hande, P., Lan, T., & Tan, C. W. (2007) · now publishers, Inc. eBooks · doi:10.1561/9781601981370 · Cited by 361
Stability of primal–dual gradient dynamics and applications to network optimization
Feijer, D., & Paganini, F. (2010) · Automatica · doi:10.1016/j.automatica.2010.08.011 · Cited by 349
Optimal Resource Allocation in Coordinated Multi-Cell Systems
Björnson, E., & Jorswieck, E. (2013) · Foundations and Trends® in Communications and Information Theory · doi:10.1561/0100000069 · Cited by 349
A Unified Framework for Max-Min and Min-Max Fairness With Applications
Radunovic, B., & Le Boudec, J.-Y. (2007) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2007.896231 · Cited by 345
Energy Efficiency in Wireless Networks via Fractional Programming Theory
Zappone, A., & Jorswieck, E. (2015) · now publishers, Inc. eBooks · doi:10.1561/9781680830439 · Cited by 326
Network Optimization and Control
Shakkottai, S., & Srikant, R. (2007) · Foundations and Trends® in Networking · doi:10.1561/1300000007 · Cited by 320
Deep-Reinforcement Learning Multiple Access for Heterogeneous Wireless Networks
Yu, Y., Wang, T., & Liew, S. C. (2019) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2019.2904329 · Cited by 319
The impact of imperfect scheduling on cross-layer congestion control in wireless networks
Lin, X., & Shroff, N. B. (2006) · doi:10.1109/tent.2006.872546 · Cited by 306
Coding Techniques for Repairability in Networked Distributed Storage Systems
Oggier, F., & Datta, A. (2013) · Foundations and Trends in Communications and Information Theory · doi:10.1561/0100000068 · Cited by 305
Power Control in Wireless Cellular Networks
Chiang, M., Hande, P., Lan, T., & Tan, C. W. (2008) · Foundations and Trends in Networking · doi:10.1561/1300000009 · Cited by 304
On the Efficiency-Fairness Trade-off
Bertsimas, D., Farias, V. F., & Trichakis, N. (2012) · Management Science · doi:10.1287/mnsc.1120.1549 · Cited by 294
Alternative Distributed Algorithms for Network Utility Maximization: Framework and Applications
Palomar, D. P., & Chiang, M. (2007) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2007.910665 · Cited by 294
Transport protocols for Internet-compatible satellite networks
Henderson, T. R., & Katz, R. H. (1999) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.748815 · Cited by 280
Huang, J., Subramanian, V., Agrawal, R., & Berry, R. (2009) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2009.090213 · Cited by 278
The impact of imperfect scheduling on cross-Layer congestion control in wireless networks
Lin, X., & Shroff, N. B. (2006) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2006.872546 · Cited by 268
(2005) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2004.837347 · Cited by 259
Distributed Non-Autonomous Power Control through Distributed Convex Optimization
Ram, S. S., Veeravalli, V. V., & Nedic, A. (2009) · IEEE INFOCOM 2009 · doi:10.1109/infcom.2009.5062275 · Cited by 99
A Utility Optimization Approach to Network Cache Design
Dehghan, M., Massoulie, L., Towsley, D., Menasche, D. S., & Tay, Y. C. (2019) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2019.2913677 · Cited by 81
Heterogeneity-aware fair federated learning
Li, X., Zhao, S., Chen, C., & Zheng, Z. (2023) · Information Sciences · doi:10.1016/j.ins.2022.11.031 · Cited by 43
Learning to Continuously Optimize Wireless Resource in Episodically Dynamic Environment
Sun, H., Pu, W., Zhu, M., Fu, X., Chang, T.-H., & Hong, M. (2021) · ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) · doi:10.1109/icassp39728.2021.9413503 · Cited by 21
Tiwana, M. I., Nawaz, S. J., Ikram, A. A., & Tiwana, M. I. (2014) · Elektronika ir Elektrotechnika · doi:10.5755/j01.eee.20.9.4786 · Cited by 5
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.