Previous [ 1] [ 2] [ 3] [ 4] [ 5] [ 6] [ 7] [ 8] [ 9] [ 10] [ 11] [ 12] [ 13] [ 14] [ 15] [ 16] [ 17] [ 18] [ 19] [ 20]

@

Journal of Information Science and Engineering, Vol. 23 No. 6, pp. 1753-1767 (November 2007)

Speedup Requirements for Output queuing Emulation wiht a Parallel Packet Switch

Chia-Lung Liu, Chin-Chi Wu and Woei Lin
1Institute of Computer Science
National Chung Hsing University
Taichung, 402 Taiwan
*E-mail: {s9056005; wlin}@cs.nchu.edu.tw
2Information and Communications Research Labs
Industrial Technology Research Institute
Hsinchu, 310 Taiwan
3Department of Information Management
Nan Kai Institute of Technology
Nantou, 542 Taiwan

This work analyzes whether a parallel packet switch (PPS) can emulate an output- queued (OQ) packet switch. The class of PPS is characterized by the deployment of parallel low-speed switches. Each lower speed packet switch operates at only a fraction of the input line rate R. This study develops and investigates a PPS which distributes cells to low-speed switches and uses outputs with push-in arbitrary-out (PIAO) queues. We present a novel Markov chain model that successfully exhibits these performance characteristics. The simulation results demonstrate that the developed Markov chain model is accurate for practical network loads. The major findings, obtained using the proposed model, are that: (1) the throughput and cell drop rates of a PPS can theoretically emulate those of an OQ packet switch as indicated in Eq. (49); and (2) the cell delay of a PPS can theoretically emulate that of an OQ packet switch as given by Eq. (51).

Keywords: Markov chain, parallel packet switch, OQ switch, PIAO queues, emulation

Full Text () Retrieve PDF document (200711_07.pdf)

Received September 16, 2005; revised May 5 & June 30, 2006; accepted August 11, 2006.
Communicated by David H. C. Du.