Congestion control with explicit rate indication
Top Cited Papers
- 19 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 1954-1963
- https://doi.org/10.1109/icc.1995.524537
Abstract
As the speed and the dynamic range of computer networks evolve, the issue of efficient traffic management becomes increasingly important. This work describes an approach to traffic management using explicit rate information provided to the source by the network. We 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.Keywords
All Related Versions
This publication has 18 references indexed in Scilit:
- An adaptive congestion control scheme for real time packet video transportIEEE/ACM Transactions on Networking, 1995
- The Q-bit schemeACM SIGCOMM Computer Communication Review, 1992
- Round-robin scheduling for max-min fairness in data networksIEEE Journal on Selected Areas in Communications, 1991
- Observations on the dynamics of a congestion control algorithmPublished by Association for Computing Machinery (ACM) ,1991
- A control-theoretic approach to flow controlPublished by Association for Computing Machinery (ACM) ,1991
- A dynamic rate control mechanism for source coded traffic in a fast packet networkIEEE Journal on Selected Areas in Communications, 1991
- A stop-and-go queueing framework for congestion managementACM SIGCOMM Computer Communication Review, 1990
- Dynamic control of session input rates in communication networksIEEE Transactions on Automatic Control, 1984
- Bottleneck Flow ControlIEEE Transactions on Communications, 1981
- Flow Control: A Comparative SurveyIEEE Transactions on Communications, 1980