Abstract

In this paper we introduce our concept of the requirements of an efficient admission control algorithm and propose new algorithms. Our methods need only aggregate traffic measurements and simple FIFO scheduling. We take minimal assumptions on the pattern of the traffic. Our framework defines a family of measurement based admission control algorithms of which we discuss three key members. We give effective bandwidth formulae for buffered and bufferless systems with token bucket and peak rate limited sources. We also showhow the utilization can be improved by measuring the variance of the traffic rate while avoiding the limitations of the Central-limit theorem. The theoretical background of our work is the effective bandwidth definition introduced by Gibbens and Kelly which has its roots in the Chernoff bounds.

Citations