The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
End-to-end congestion control schemes: utility functions, random losses and ecn marks
Abstract
We present a framework for designing end-to-end congestion control schemes in a network where each user may have a different utility function and may experience noncongestion-related losses. We first show that there exists an additive-increase-multiplicative-decrease scheme using only end-to-end measurable losses such that a socially optimal solution can be reached. We incorporate round-trip delay in this model, and show that one can generalize observations regarding TCP-type congestion avoidance to more general window flow control schemes. We then consider explicit congestion notification (ECN) as an alternate mechanism (instead of losses) for signaling congestion and show that ECN marking levels can be designed to nearly eliminate losses in the network by choosing the marking level independently for each node in the network. While the ECN marking level at each node may depend on the number of flows through the node, the appropriate marking level can be estimated using only aggregate flow measurements, i.e., per-flow measurements are not required.
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
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
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
Fair end-to-end window-based congestion control
Mo, J., & Walrand, J. (2000) · IEEE/ACM Transactions on Networking · doi:10.1109/90.879343 · Cited by 2,095
Optimization flow control. I. Basic algorithm and convergence
Low, S. H., & Lapsely, D. E. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.811451 · Cited by 1,972
Congestion avoidance and control
Jacobson, V. (1988) · ACM SIGCOMM Computer Communication Review · doi:10.1145/52325.52356 · Cited by 1,955
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
Stochastic Approximation Methods for Constrained and Unconstrained Systems
Kushner, H. J., & Clark, D. S. (1978) · Applied Mathematical Sciences · doi:10.1007/978-1-4684-9352-8 · Cited by 1,459
Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED
Misra, V., Gong, W.-B., & Towsley, D. (2000) · ACM SIGCOMM Computer Communication Review · doi:10.1145/347057.347421 · Cited by 1,274
Modeling TCP Reno performance: a simple model and its empirical validation
Padhye, J., Firoiu, V., Towsley, D. F., & Kurose, J. F. (2000) · IEEE/ACM Transactions on Networking · doi:10.1109/90.842137 · Cited by 1,184
TCP and explicit congestion notification
Floyd, S. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205511.205512 · Cited by 1,016
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
Improving TCI/IP performance over wireless networks
Balakrishnan, H., Seshan, S., Amir, E., & Katz, R. H. (1995) · Proceedings of the 1st annual international conference on Mobile computing and networking - MobiCom '95 · doi:10.1145/215530.215544 · Cited by 757
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
Resource pricing and the evolution of congestion control
Gibbens, R. J., & Kelly, F. P. (1999) · Automatica · doi:10.1016/s0005-1098(99)00135-1 · Cited by 544
Analysis and design of an adaptive virtual queue (AVQ) algorithm for active queue management
Kunniyur, S., & Srikant, R. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383069 · Cited by 490
Self-citationFluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED
Misra, V., Gong, W.-B., & Towsley, D. (2000) · Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication · doi:10.1145/347059.347421 · Cited by 427
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.2307/3010473 · Cited by 401
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
An Adaptive Virtual Queue (AVQ) Algorithm for Active Queue Management
Kunniyur, S. S., & Srikant, R. (2004) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2004.826291 · Cited by 368
Self-citationComparative performance analysis of versions of TCP in a local network with a lossy link
Kumar, A. (1998) · IEEE/ACM Transactions on Networking · doi:10.1109/90.720921 · Cited by 299
Barndorff-Nielsen, O. E., Gill, R. D., & Jupp, P. E. (2001) · Springer eBooks · doi:10.1007/978-3-642-56478-9_6 · Cited by 125
Nollau, V. (1980) · ZAMM ‐ Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik · doi:10.1002/zamm.19800600133 · Cited by 122
A 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
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
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
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
Self-citationA 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
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
Metadata
- Authors
- Kunniyur, S., & Srikant, R.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2003-10
- Volume
- 11
- Issue
- 5
- Pages
- 689-702
- ISSN
- 1063-6692 (ISSN-L)
- OpenAlex
- W2174430759
- Cited by
- 448
- References
- 30
- FWCI
- 57.17
- 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.