A connection admission control algorithm based on empirical traffic measurements

One important class of applications of ATM networks is interactive programs. In order to provide quality of service (QoS) requirements for all connections, connection admission control (CAC) is an essential mechanism. Traditional CAC algorithms only take the requested bandwidth (i.e., peak rate and mean rate) into consideration. This is not efficient for long distance connections of interactive applications. From our traffic measurement experiments, networks are underutilized for bursty traffic which has a high peak-to-mean ratio and small peak durations. This paper presents a new CAC algorithm which is also designed for interactive applications. Traffic measurements from our ATM testbed illustrate that the proposed call admission control algorithm is feasible in real networks. An analysis of the channel utilization of our algorithm is also presented.