Admission control schemes for bursty multimedia traffic

We introduce a new framework for various measurement-based connection admission control (MBCAC) schemes for a multiservice network. Then, using heterogeneous bursty multimedia traffic traces, efficiency and simplicity tradeoffs are obtained by simulations. For all our MBCAC schemes, we use a procedure of `available bandwidth´ evaluation based on online measurements and an adaptive feedback mechanism. The online measurement concept is based on the use of different `traffic histograms´ that maintain records of the aggregated traffic in a link over a range of time-scales. The most complex MBCAC scheme involves measuring and then storing of all traffic information for every connection, the use of a `warming up period´ technique, and updating the histograms when a connection departs. However, for the other simpler MBCAC schemes, various aspects of the most complex scheme are eliminated or simplified. We also consider two model-based CAC schemes, i.e., Gaussian and effective bandwidth, where a priori statistical knowledge of the connections are known in advance. Given that the traffic is known beforehand, the performance of such schemes will be better than if the statistics are not exactly known. A comparison between such model-based CAC schemes with our MBCAC schemes provides a benchmark that gives the best efficiency and QoS a model-based CAC may achieve. Simulation results demonstrate that while the best efficiency achievable by the model-based gives efficiency of 80%, the most complex MBCAC schemes achieved 81% efficiency, and the simplest MBCAC schemes obtained 76% value