Congestion control with explicit rate indication

As the speed and the dynamic range of computer networks evolve, the issue of efficient traffic management becomes increasingly important. The paper describes an approach to traffic management using explicit rate information provided to the source by the network. The authors present an asynchronous distributed algorithm for optimal rate calculation across the network, where optimality is understood in the maxmin sense. The algorithm quickly converges to the optimal rates and is shown to be well-behaved in transience.

[1]  Bolt Beranek,et al.  A Control Theoretic Approach to , 1971 .

[2]  Seyyed Jamaaloddin Golestaani,et al.  A unified theory of flow control and routing in data communication networks , 1980 .

[3]  Mario Gerla,et al.  Flow Control: A Comparative Survey , 1980, IEEE Trans. Commun..

[4]  Howard Paul Hayden,et al.  Voice flow control in integrated packet networks , 1981 .

[5]  Jeffrey M. Jaffe,et al.  Bottleneck Flow Control , 1981, IEEE Trans. Commun..

[6]  Eli Gafni,et al.  Dynamic Control of Session Input Rates in Communication Networks , 1982, MILCOM 1982 - IEEE Military Communications Conference - Progress in Spread Spectrum Communications.

[7]  Jeannine Mosely,et al.  Asynchronous distributed flow control algorithms , 1984 .

[8]  John Nagle,et al.  On Packet Switches with Infinite Storage , 1985, IEEE Trans. Commun..

[9]  E. L. Hahne,et al.  Round robin scheduling for fair flow control in data communication networks , 1986, ICC.

[10]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[11]  V. Jacobson,et al.  Congestion avoidance and control , 1988, SIGCOMM '88.

[12]  Ashok K. Agrawala,et al.  Design and analysis of a flow control algorithm for a network of rate allocating servers , 1990 .

[13]  S. Jamaloddin Golestani.  A Stop-and-Go Queueing Framework for Congestion Management , 1990, SIGCOMM.

[14]  S. J. Golestani.  A stop-and-go queueing framework for congestion management , 1990, SIGCOMM 1990.

[15]  David Clark,et al.  Architectural considerations for a new generation of protocols , 1990, SIGCOMM 1990.

[16]  Scott Shenker,et al.  A theoretical analysis of feedback flow control , 1990, SIGCOMM '90.

[17]  Srinivasan Keshav,et al.  A control-theoretic approach to flow control , 1991, SIGCOMM '91.

[18]  S. Shenker,et al.  Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic , 1991, SIGCOMM '91.

[19]  Nanying Yin,et al.  A Dynamic Rate Control Mechanism for Source Coded Traffic in a Fast Packet Network , 1991, IEEE J. Sel. Areas Commun..

[20]  E. L. Hahne,et al.  Round-Robin Scheduling for Max-Min Fairness in Data Networks , 1991, IEEE J. Sel. Areas Commun..

[21]  R. Jain,et al.  Myths about Congestion Management in High-speed , 1992 .

[22]  Scott Shenker,et al.  Supporting real-time applications in an Integrated Services Packet Network: architecture and mechanism , 1992, SIGCOMM '92.

[23]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the single node case , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[24]  O. Rose,et al.  The Q-bit scheme: congestion avoidance using rate-adaptation , 1992, CCRV.

[25]  Partho Pratim Mishra,et al.  A hop by hop rate-based congestion control scheme , 1992, SIGCOMM 1992.

[26]  Raj Jain,et al.  Myths about Congestion Management in High Speed Networks , 1992, INDC.

[27]  Amy R. Reibman,et al.  An adaptive congestion control scheme for real-time packet video transport , 1993, SIGCOMM 1993.

[28]  A. Reibman,et al.  An adaptive congestion control scheme for real-time packet video transport , 1993, SIGCOMM '93.

[29]  A. Charny,et al.  An Algorithm for Rate Allocation in a Packet-Switching Network With Feedback , 1994 .

[30]  K. K. Ramakrishnan,et al.  A binary feedback scheme for congestion avoidance in computer networks with a connectionless network layer , 1995, CCRV.