A scalable call admission control algorithm for ATM networks

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.