Analytical analysis of ATM switches with multiple input queues with bursty traffic

Abstract

A queueing model for a novel multiple input-queued ATM switch under i.i.d bursty traffic modeled by 2-state Markov modulated Bernoulli processes (MMBPs) is proposed. A quasi-birth-death (QBD) chain is constructed as the underlying Markov chain of the queueing model. Each input port of the switch maintains N separate queues each for buffering cells destined to one of the N outputs and an efficient randomized parallel algorithm, called parallel iterative matching (PIM) is used by the switch to schedule the head-of-line (HOL) cells of the input queues out to the output queues. The QBD chain is solved by finding the fixed point of the introduced fixed point equation using an iterative computing scheme. Interesting performance parameters of the switch such as the throughput, the mean cell delay and the cell loss probability are derived from the solved QBD chain. Numerical results from both the analytical model and simulations are presented and the accuracy of the analysis is discussed. The queueing model can be extended using the same technique to the situation where complicated bursty traffic with more states is asserted to the switch.