Abstract
This paper presents an efficient link-sharing method for available bit rate and unspecified bit rate services in ATM networks. The method comprises an algorithm that performs cell multiplexing and scheduling such that the outgoing link is fairly shared by multiple traffic flows. The proposed algorithm adopts a dynamic priority assignment to each ATM cell, and schedules those cells having the same priority level into repeating cycles in a round-robin fashion. The algorithm also guarantees each ABR connection a specified minimum cell rate and a satisfied cell loss rate. The performance is evaluated through simulations and is also compared with another fixed method called weighted round robin. Finally, a corresponding hardware design that uses a two-stage leaky bucket circuit is presented.
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.
