Journal of Communications and Networks

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

Mathematical Analysis of the Parallel Packet Switch with a Sliding Window Scheme

  • Liu, Chia-Lung (Computer Science Institute of the National Chung-Hsing University, Information & Communications Research Lab., Industrial Technology Research Institute) ;
  • Wu, Chin-Chi (Computer Science Institute of the National Chung-Hsing University and Nan Kai Institute of Technology) ;
  • Lin, Woei (Computer Science Institute of the National Chung-Hsing University)
  • Published : 2007.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

This work analyzes the performance of the parallel packet switch (PPS) with a sliding window (SW) method. The PPS involves numerous packet switches that operate independently and in parallel. The conventional PPS dispatch algorithm adopts a round robin (RR) method. The class of PPS is characterized by deployment of parallel low-speed switches whose all memory buffers run more slowly than the external line rate. In this work, a novel SW packet switching method for PPS, called SW-PPS, is proposed. The SW-PPS employs memory space more effectively than the existing PPS using RR algorithm. Under identical Bernoulli and bursty data traffic, the SW-PPS provided significantly improved performance when compared to PPS with RR method. Moreover, this investigation presents a novel mathematical analytical model to evaluate the performance of the PPS using RR and SW method. Under various operating conditions, our proposed model and analysis successfully exhibit these performance characteristics including throughput, cell delay, and cell drop rate.

Keywords

References

  1. M. Karol, M. Hluchyj, and S. Morgan, 'Input versus output queueing on a space-division packet switch,' IEEE Trans. Commun., vol. 35, no. 12, pp. 1347-1356, Dec. 1987 https://doi.org/10.1109/TCOM.1987.1096719
  2. J. Hui and E. Arthurs, 'A broadband packet switch for integrated transport,' IEEE J. Sel. Areas Commun., vol. 5, no. 8, pp. 1264-1273, Aug. 1987 https://doi.org/10.1109/JSAC.1987.1146650
  3. S.-T. Chuang, A. Goel, N. McKeown, and B. Prabhakar, 'Matching output queueing with a combined input/output-queued switch,' IEEE J. Sel. Areas Commun., vol. 17, no. 6, pp. 1030-1039, June 1999 https://doi.org/10.1109/49.772430
  4. M. Yang and S. Zheng, 'An efficient scheduling algorithm for cioq switches with space-division multiplexing expansion,' in Proc. IEEE INFOCOM, vol. 3, 2003, pp. 1643-1650
  5. S. Iyer and N. McKeown, 'Analysis of the parallel packet switch architecture,' IEEE/ACM Trans. Networking, vol. 11, no. 2, pp. 314-324, Apr. 2003 https://doi.org/10.1109/TNET.2003.810315
  6. W. Wang, L. Dong, and W. Wolf, 'A distributed switch architecture with dynamic load-balancing and parallel input-queued crossbars for terabit switch fabrics,' in Proc. INFOCOM, vol. 1,2002, pp. 352-361
  7. A. Aslam and K. Christensen, 'Parallel packet switching using multiplexors with virtual input queues,' in Proc. LCN, 2002, pp. 270-277
  8. S. Kumar, 'The sliding-window packet switch: A new class of packet switch architecture with plural memory modules and decentralized control,' IEEE J. Sel. Areas Commun., vol. 21, no. 4, pp. 656--673, May 2003 https://doi.org/10.1109/JSAC.2003.810513
  9. S. Kumar and D. Agrawal, 'The sliding-window approach to high performance atm switching for broadband networks,' in Proc. IEEE GLOBECOM, vol. 1, 1996, pp. 772-777
  10. C. Clos, 'A study of nonblocking switch networks,' Bell System Technical J., vol. 32, no.2, pp.406-424, 1953 https://doi.org/10.1002/j.1538-7305.1953.tb01433.x
  11. C. L. Liao and W. Lin, 'Performance analysis of general cut-through switching on buffered min switches,' J. Inf. Science Eng., vol. 18, no. 5, pp. 745-762, 2002
  12. T. Szymanski and S. Shaikh, 'Markov chain analysis of packet-switched banyans with arbitrary switch sizes, queue sizes, link multiplicities and speedups,' in Proc. IEEE INFOCOM, voI.3, 1989, pp. 960-971