Performance analysis of output buffered fast packet switches with bursty traffic loading

The authors address the performance analysis of output buffered packet switches under bursty traffic loading. The packet arrival process to each input port is modeled by a first-order two-state Markov chain. Both infinite and finite buffering capacity are considered. The queuing system is described by a first-order two-dimensional Markov chain. The transform approach is used to derive an expression for the moment generating function of the queue length distribution. For the finite buffer case, the system occupancy probabilities are obtained by solving a set of simultaneous linear equations. Numerical results indicate that, compared to the uncorrelated arrival case, the average waiting time and buffer overflow probability increase under a bursty traffic loading