Performance evaluation of multiple input-queued ATM switches with PIM scheduling under bursty traffic

In this letter, we analyze the performance of multiple input-queued asynchronous transfer mode (ATM) switches that use parallel iterative matching (PIM) for scheduling the transmission of head-of-line cells in the input queues. A queueing model of the switch is developed under independently, identically distributed, two-state Markov modulated Bernoulli processes bursty traffic. The underlying Markov chain of the queueing model is a quasi-birth-death (QBD) chain. The QBD chain is solved using an iterative computing method. Interesting performance metrics of the ATM switch such as the throughput, the mean cell delay, and the cell loss probability can be derived from the model. Numerical results from both the analytical model and simulation are presented, and the accuracy of the analysis is briefly discussed.

[1]  Ge Nong,et al.  Analysis of nonblocking ATM switches with multiple input queues , 1999, TNET.

[2]  A. Adas,et al.  Traffic models in broadband networks , 1997, IEEE Commun. Mag..

[3]  Thomas E. Anderson,et al.  High speed switch scheduling for local area networks , 1992, ASPLOS V.

[4]  H. T. Nguyen,et al.  The performance analysis and implementation of an input access scheme in a high-speed packet switch , 1994, IEEE Trans. Commun..

[5]  Ge Nong,et al.  A performance model for ATM switches with multiple input queues , 1997, Proceedings of Sixth International Conference on Computer Communications and Networks.

[6]  Chong Kwan Un,et al.  Performance Analysis of Packet Switches with Input and Output Buffers , 1994, Comput. Networks ISDN Syst..