Abstract
In this paper we propose a computationally efficient and scalable algorithm for connection admission control (CAC) for an ATM switch with a FIFO buffer. The sources may be heterogeneous both in terms of their statistical characteristics as well as their quality of service (QoS) requirements. The performance of the proposed CAC scheme is evaluated against various CAC algorithms proposed in the literature and using simulation results. Our results show that the proposed CAC consistently performs better and operates the link close to the highest possible utilization level.
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.
