Allocating fair rates for available bit rate service in ATM networks
- 1 January 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Magazine
- Vol. 34 (11) , 92-100
- https://doi.org/10.1109/35.544198
Abstract
A central issue in congestion control for the available bit rate (ABR) service in ATM networks is the computation of the fair rate for every connection at each switching node in the network. The objective is to determine the fair rate for all the connections in a distributed network under dynamic changes in the absence of centralized knowledge about the network, and without the synchronization of different network components. The authors study the problem of fair rate allocation, specifying the requirements of a fair rate allocation algorithm, and provide a survey of various proposed fair rate allocation strategies in the context of the ABR serviceKeywords
This publication has 8 references indexed in Scilit:
- Dynamic max rate control algorithm for available bit rate service in ATM networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Scalability issues for distributed explicit rate allocation in ATM networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Max-min rate control algorithm for available bit rate service in ATM networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Congestion control with explicit rate indicationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An efficient rate allocation algorithm for ATM networks providing max-min fairnessPublished by Springer Nature ,1995
- The rate-based flow control framework for the available bit rate ATM serviceIEEE Network, 1995
- Intelligent congestion control for ABR service in ATM networksACM SIGCOMM Computer Communication Review, 1994
- Bottleneck Flow ControlIEEE Transactions on Communications, 1981