Abstract
The central issue of explicit rate control for available bit rate (ABR) service in ATM networks is the computation of fair rate for every connection. In this paper, we propose a new fair-rate allocation algorithm called fast max-min rate allocation (FMMRA) for ATM switches supporting ABR services. The FMMRA algorithm provides the means to compute the max-min fair rates with O(1) computational complexity. This exact calculation of fair rates expedites quick convergence to max-min fair shares, and offers excellent transient response. At the steady state, the algorithm operates without causing any oscillations in rates. The FMMRA algorithm does not require any parameter tuning and proves to be very robust in a large ATM network. Some simulation results are provided to show the effectiveness of the algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
