A connection admission control algorithm for self-similar traffic

This paper describes a CAC algorithm for self-similar traffic (SS-CAC), that can take into account multiplexing gains due to buffering, and multiplexing gains across independent sources. Several variations of this CAC are discussed, and the performance of SS-CAC against several standard theoretical algorithms is demonstrated using a number of numerical examples, varying mean and peak rates, the Hurst parameter, buffer sizes, and QoS objectives. It is shown that in general, no algorithm can be said to be consistently “optimistic” or “pessimistic”, so it is important for the algorithm to take into account the characteristics of actual network traffic. A case is then made for measurement-based CACs, and a potential method by which the SS-CAC can be extended to incorporate performance and traffic measurements is discussed