Premium
An enhanced explicit rate algorithm for ABR traffic control in ATM networks
Author(s) -
Long Y. H.,
Ho T. K.,
Rad A. B.
Publication year - 2001
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.515
Subject(s) - computer science , network congestion , algorithm , computation , asynchronous transfer mode , rate of convergence , flow control (data) , convergence (economics) , computer network , max min fairness , computational complexity theory , resource allocation , economics , channel (broadcasting) , network packet , economic growth
A high performance, low computational complexity rate‐based flow control algorithm which can avoid congestion and achieve fairness is important to ATM available bit rate service. The explicit rate allocation algorithm proposed by Kalampoukas et al. is designed to achieve max–min fairness in ATM networks. It has several attractive features, such as a fixed computational complexity of O (1) and the guaranteed convergence to max–min fairness. In this paper, certain drawbacks of the algorithm, such as the severe overload of an outgoing link during transient period and the non‐conforming use of the current cell rate field in a resource management cell, have been identified and analysed; a new algorithm which overcomes these drawbacks is proposed. The proposed algorithm simplifies the rate computation as well. Compared with Kalampoukas's algorithm, it has better performance in terms of congestion avoidance and smoothness of rate allocation. Copyright © 2001 John Wiley & Sons, Ltd.