Analysis of an ATM statistical multiplexer with heterogeneous Markovian on/off sources and applications to call admission control

Abstract

A computationally efficient algorithm for characterizing the superposition process of N heterogeneous and independent Interrupted Bernoulli Processes is first introduced. The algorithm is then used to analyze a statistical multiplexer with a finite buffer. Numerical examples highlighting the accuracy of algorithm are given. Finally, we use the algorithm to test two popular schemes for call admission control in an ATM network, namely the equivalent capacity and the heavy traffic approximation methods.