Statistical Properties Of A Near-Optimal Measurement-Based Cac Algorithm

Our algorithm, called Mosquito(3), allows sources to be ignorant of their statistics but offers near-optimal utilisation of the network. Our approach is based on Large Deviation Theory : the large deviation rate-function (entropy) of bursty ATM traffic can be estimated from measurements of traffic activity. The entropy can be used to determine the bandwidth requirement of the traffic. In this paper, we explain the basic ideas behind the algorithm and describe its implementation. We present some results of a statistical investigation of the performance of the Mosquito CAC algorithm comparing it with that of various modifications of the algorithm.