For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Analysis and Design of a Stable Congestion Avoidance Algorithm for ABR Service in ATM Networks
Tanun JARUVITAYAKOVIT Naris RANGSINOPPAMAS Prasit PRAPINMONGKOLKARN
IEICE TRANSACTIONS on Communications
Publication Date: 2002/09/01
Print ISSN: 0916-8516
Type of Manuscript: PAPER
asynchronous transfer mode networks, available bit rate service, explicit rate allocation, fast rate allocation congestion avoidance (FRACA),
Full Text: PDF>>
This paper proposes a stable rate allocation algorithm for ABR service in ATM networks. The main goals in designing this algorithm are to speed up the convergence according to the max-min fairness criterion and to maximize the network utilization while the switch queue length can be properly controlled. Importantly, the set goals should be achieved in a wide range of network conditions without the need for adjusting the algorithm parameters. The algorithm is targeted to work in various networking environments with additional criteria as extended from the work of E-FMMRA (Enhanced Fast Max-Min Rate Allocation) and ERICA+ (Explicit Rate Indication for Congestion Avoidance) . The additional design criteria include the ability to enhance a large number of ABR connections and staggered TCP connections as well as to perform an accurate traffic averaging. The algorithm is analytically proved to be convergent. Simulation results indicate that the proposed algorithm achieves the goals in all evaluated configurations. However, it has some limitations when working in the large-scale network due to its per-connection accounting. It is not recommended to implement the algorithm with a switch that has a small buffer size due to its relatively long averaging interval.