Abstract
Connection admission control (CAC) is a common traffic management technique used in Asynchronous Transfer Mode (ATM) networks to provide Quality of Service (QoS) guarantees. In this paper we describe the requirements of CAC algorithms, and present an overview of existing CAC models. Then, we introduce a real-time adaptation of the Extended Gibbens-Hunt (EGH) CAC method and compare its performance against other competing strategies using the Buffet and Duffield bound as a reference. Our results show that EGH is a superior CAC technique that guarantees QoS while offering the highest link utilization possible. EGH is the CAC algorithm of choice for Nortel Magellan(1) Passport and Concorde ATM switches.