Modeling connection admission control

Abstract

The performance of connection admission control is analyzed on the basis of the single-class, single-queue scheme with input consisting of statistically identical on-off traffic sources, each modeled by an IPP process. The scheme known as the MMPP/G/1/K queue is first analyzed exactly. The computational complexity associated with the exact analysis becomes intolerable for increasing dimensionality of both buffer space and number of traffic sources, so a computationally simple approximation for the model, using a quasi-stationary approximation technique, is proposed. The validity of this approximation is examined through the transient analysis of the underlying state process. Numerical results illustrate the effectiveness of the quasi-stationary approximation and provide insight into the system performance.<>