Performance Study of an ATM Self‐Routing Multistage Switch with Bursty Traffic: Simulation and Analytic Approximation

Abstract
AnNxNself‐routing multistage switching network with bursty and uniform traffic, which is composed ofSx 5 switching elements with output queueing and hasK= logSNstages, is considered in this paper. The input traffic is modelled by a two‐state (active/silent) Markov chain. Each arriving cell selects one of theNoutlets as its destination independently and with equal probability I/N.The performance of the switching network is studied by means of a simulation method. An approximate traffic model of a four‐state Markov chain is proposed to characterize the cell arrival processes to further stages and its related switching element performance is analyzed. Comparison with the simulation results shows that the proposed traffic model gives a good approximation, which implies that the performance of the switching element mainly depends on the first two moments of the active and silent periods and is not sensitive to the shapes of their distributions. The influence of bursty traffic on the performance of the switching network is discussed and illustrated by some numerical examples. The impact of traffic randomization on the performance of the switching network is also investigated.

This publication has 12 references indexed in Scilit: