Please use this identifier to cite or link to this item: http://hdl.handle.net/1783.1/16969

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

Authors Nong, Ge
Hamdi, Mounir View this author's profile
Muppala, K. R. Jogesh View this author's profile
Issue Date 2001
Source IEEE transactions on communications , v. 49, (8), 2001, AUG, p. 1329-1333
Summary In this letter, we analyze the performance of multiple input-queued asynchronous transfer mode (ATM) switches that use parallel iterative matching 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.
ISSN 0090-6778
Language English
Format Article
Access View full-text via Web of Science
Find@HKUST