To appear in 15th International Teletraffic Congress, June 1997
The performance of measurement-based admission control depends upon statistical interactions between several time-scales, ranging from the very short time scales associated with cell or packet queueing, through burst time-scales, to the time-scales associated with admission decisions and the holding times of connections. In this paper we continue the development of a modelling approach which attempts to integrate these several time-scales, and illustrate its application to the analysis of a family of simple and robust measurement-based admission controls. A subsidiary aim of the paper is to shed light on the relationship between the admission control proposed for ATM networks by Gibbens et al and that proposed for controlled-load Internet services by Floyd. We shall see that their common origin in Chernoff bounds allows the definition of a simple and general family of admission controls, capable of tailoring for several implementation scenarios.