TY  - JOUR
T1  - Performance evaluation of multiple input-queued ATM switches with PIM scheduling under bursty traffic.
JF  - IEEE Transactions on communications
A1  - Ge Nong
LA  - English
UL  - https://tuklas.up.edu.ph/Record/UP-99796217609484336
AB  - 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
KW  - Markov chain.
KW  - PIM scheduling.
KW  - QBD chain.
KW  - Asynchronous transfer mode.
KW  - Bursty traffic.
KW  - Cell loss probability.
KW  - Head-of-line cells.
KW  - Independently identically distributed system.
KW  - Iterative computing method.
KW  - Mean cell delay.
KW  - Multiple input-queued ATM switches.
KW  - Parallel iterative matching.
KW  - Performance evaluation.
KW  - Quasi-birth-death chain.
KW  - Queueing model.
KW  - Throughput.
KW  - Two-state Markov modulated Bernoulli processes bursty traffic.
ER  -