A Simulation Analysis of a QoS - Based CAC

This paper describes a connection admission control (CAC) algorithm for ATM networks supporting diierent Quality of Service (QoS) classes, and illustrates its eeectiveness with simulation results considering both the call-level and the cell-level dynamics. The CAC algorithm groups connection requests within three diierent QoS classes: 1) Class 1: with stringent CLR (Cell Loss Rate) and CDV (Cell Delay Variation) requirements; 2) Class 2: with stringent CLR requirements, but no need for CDV guarantees; 3) Class U: with no need for guarantees on either CLR or CDV. Both CBR and VBR connections can request admission as either Class 1 or Class 2, depending on their QoS requirements. UBR and ABR connections instead normally request admission as Class U. The investigation of the eeectiveness of the CAC algorithm is based on the simulation of an ATM network with parking lot topology, and with variable parameter values.