Efficient simulation of cell loss probability using standardized ATM connection traffic descriptors

In ATM networks, the purpose of connection admission control is to decide if allowing a new connection into the network violates a quality of service measure, such as the cell loss probability. Testing the algorithms that perform connection admission control is difficult because of the complexity of the ATM switches, the low cell loss probabilities required by ATM networks, and the unwieldiness of matching statistical models of the traffic entering the network to the connection traffic descriptors used by the call admission control algorithm. In the paper, instead of using statistical traffic models, the authors describe the traffic entering the network by the connection traffic descriptors standardised by the ATM Forum. They develop a simulation model for estimating the cell loss probability, derive upper and lower bounds on the cell loss probability, use importance sampling to increase the efficiency of the simulation, and find an analytical solution for the improvement in simulation efficiency. For the examples considered they obtained 3 to 9 orders of magnitude improvement in efficiency compared to conventional Monte Carlo simulation.

[1]  J. Keith Townsend,et al.  Fast simulation of queueing networks using stochastic gradient techniques and importance sampling , 1994 .

[2]  Yasuhiro Miyao,et al.  A call admission control scheme in ATM networks , 1991, ICC 91 International Conference on Communications Conference Record.

[3]  Victor S. Frost,et al.  Efficient estimation of cell blocking probability for ATM systems , 1993, TNET.

[4]  Harry G. Perros,et al.  A literature review of call admission algorithms , 1994 .

[5]  Bijan Jabbari,et al.  An upper bound for cell loss probability of bursty sources in broadband packet networks , 1991, ICC 91 International Conference on Communications Conference Record.

[6]  Hiroshi Saito,et al.  Call admission control in an ATM network using upper bound of cell loss probability , 1992, IEEE Trans. Commun..

[7]  J.S. Sadowsky,et al.  On large deviations theory and asymptotically efficient Monte Carlo estimation , 1990, IEEE Trans. Inf. Theory.

[8]  Michel C. Jeruchim,et al.  Techniques for Estimating the Bit Error Rate in the Simulation of Digital Communication Systems , 1984, IEEE J. Sel. Areas Commun..

[9]  R. Z. Gold Tests Auxiliary to $\chi^2$ Tests in a Markov Chain , 1963 .

[10]  Arthur W. Berger,et al.  A B-ISDN/ATM traffic descriptor, and its use in traffic and congestion controls , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.

[11]  Jean Walrand,et al.  A quick simulation method for excessive backlogs in networks of queues , 1989 .