A class of end-to-end congestion control algorithms for the Internet
- 27 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 137-150
- https://doi.org/10.1109/icnp.1998.723734
Abstract
We formulate end-to-end congestion control as a global optimization problem. Based on this formulation, a class of minimum cost flow control (MCFC) algorithms for adjusting session rates or window sizes is proposed. Significantly, we show that these algorithms can be implemented at the transport layer of an IP network and can provide certain fairness properties and user priority options without requiring non-FIFO switches. Two algorithm versions are discussed. A coarse version is geared towards implementation in the current Internet, relying on the end-to-end packet loss observations as an indication of congestion. A more complete version anticipates an Internet where sessions can solicit explicit congestion information through a concise probing mechanism. We show that TCP congestion control, after some modification, may be treated as a special case of the MCFC algorithms.Keywords
This publication has 17 references indexed in Scilit:
- A self-clocked fair queueing scheme for broadband applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The performance of TCP/IP for networks with high bandwidth-delay products and random lossIEEE/ACM Transactions on Networking, 1997
- Simulation-based comparisons of Tahoe, Reno and SACK TCPACM SIGCOMM Computer Communication Review, 1996
- Dynamic adaptive windows for high speed data networks with multiple paths and propagation delaysComputer Networks and ISDN Systems, 1993
- Random early detection gateways for congestion avoidanceIEEE/ACM Transactions on Networking, 1993
- Asymptotically optimal design of congestion control for high speed data networksIEEE Transactions on Communications, 1992
- A control-theoretic approach to flow controlPublished by Association for Computing Machinery (ACM) ,1991
- Dynamic adaptive windows for high speed data networks: theory and simulationsPublished by Association for Computing Machinery (ACM) ,1990
- Analysis of the increase and decrease algorithms for congestion avoidance in computer networksComputer Networks and ISDN Systems, 1989
- Congestion avoidance and controlPublished by Association for Computing Machinery (ACM) ,1988