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

Article type: Research Article

Authors: Elsayed, Khaled M.^; | Perros, Harry G.^;

Affiliations: BNR INC., PO Box 833871, Richardson, TX 75083-3871, USA, E-mail: [email protected] | Department of Computer Science, North Carolina State University, Raleigh, NC 27695-8206, USA, Tel.: +919 515 2858, E-mail: [email protected]

Note: [] Supported in part by BellSouth, GTE Corporation, and NSF and DARPA under cooperative agreement NCR-8919038 with the Corporation for National Research Initiatives and in part by a gift from BNR INC.

Note: [] Author to whom correspondence should be addressed.

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.

DOI: 10.3233/JHS-1997-6204

Journal: Journal of High Speed Networks, vol. 6, no. 2, pp. 123-139, 1997