An integrated approach to evaluating the loss performance of ATM switches

This work addresses model-based evaluation of cell loss probabilities for an ATM switching element with a shared output buffer. The incoming traffic to the switch is represented by the superposition of N bursty input sources, each of which is modeled as a two-state (On/Off) Markov chain. For such systems, we consider an integrated approach to their evaluation that employs both exact and approximate solutions. The exact method is based on a reduced Markov model obtained by lumping the states according to certain symmetries of the traffic model. However, even with such reduction, numerical solutions are feasible only if the switch dimensions involved, particularly the number of output ports, are reasonably small. We then introduce a new approximate solution algorithm that can be applied to larger switches. By comparing the results obtained with those of the exact method, we find that the errors of approximation are relatively small. Moreover, due to the iterative nature of the approximate solution algorithm, the two methods can be integrated so as to yield even more accurate results with less execution time.

[1]  Mark J. Karol,et al.  Queueing in high-performance packet switching , 1988, IEEE J. Sel. Areas Commun..

[2]  John F. Meyer,et al.  Dimensioning of an ATM Switch with Shared Buffer and Threshold Priority , 1993, Comput. Networks ISDN Syst..

[3]  Michel Servel,et al.  The 'Prelude' ATD experiment: assessments and future prospects , 1988, IEEE J. Sel. Areas Commun..

[4]  A. E. Eckberg,et al.  Effects of output buffer sharing on buffer requirements in an ATDM packet switching , 1988, IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?.