Evaluating switching techniques for binary n-cubes under SPP traffic

Analytical models are cost-effective and versatile tools for evaluating system performance under different design alternatives. This study presents an analytical performance model for pipelined circuit switching (PCS) in binary n-cube networks in the presence of bursty traffic, which is modeled by a switched Poisson process (SPP). The validity of the model is demonstrated by comparing analytical results to those obtained through simulation experiments of the actual system. This model and that proposed by Min et al. for wormhole switching (WS) are then used to investigate the relative performance merits of PCS and WS under bursty traffic.

[1]  Mohamed Ould-Khaoua,et al.  Performance prediction of wormhole switching in hypercubes with bursty traffic pattern , 2003, SAC '03.

[2]  Chita R. Das,et al.  Hypercube Communication Delay with Wormhole Routing , 1994, IEEE Trans. Computers.

[3]  Wolfgang Fischer,et al.  The Markov-Modulated Poisson Process (MMPP) Cookbook , 1993, Perform. Evaluation.

[4]  Leonard Kleinrock,et al.  Queueing Systems: Volume I-Theory , 1975 .

[5]  William J. Dally,et al.  Performance Analysis of k-Ary n-Cube Interconnection Networks , 1987, IEEE Trans. Computers.

[6]  Sudhakar Yalamanchili,et al.  Interconnection Networks: An Engineering Approach , 2002 .

[7]  William J. Dally.  Virtual-channel flow control , 1990, ISCA '90.

[8]  Dhabaleswar K. Panda,et al.  Impact of adaptivity on the behavior of networks of workstations under bursty traffic , 1998, Proceedings. 1998 International Conference on Parallel Processing (Cat. No.98EX205).

[9]  Tho Le-Ngoc,et al.  MMPP models for multimedia traffic , 2000, Telecommun. Syst..

[10]  Sudhakar Yalamanchili,et al.  MMR: a high-performance MultiMedia Router-architecture and design trade-offs , 1999, Proceedings Fifth International Symposium on High-Performance Computer Architecture.

[11]  Joydeep Ghosh,et al.  A Comprehensive Analytical Model for Wormhole Routng in Multicomputer Systems , 1994, J. Parallel Distributed Comput..

[12]  Mohamed Ould-Khaoua,et al.  A Performance Model for Duato's Fully Adaptive Routing Algorithm in k-Ary n-Cubes , 1999, IEEE Trans. Computers.

[13]  J. Duato,et al.  A high performance router architecture for multimedia applications , 1998 .

[14]  Mohamed Ould-Khaoua,et al.  A Comparative Study of Switching Methods in Multicomputer Networks , 2004, The Journal of Supercomputing.

[15]  Mohamed Ould-Khaoua,et al.  Performance analysis of wormhole switching in k-ary n-cubes under multimedia traffic , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[16]  Sudhakar Yalamanchili,et al.  A Family of Fault-Tolerant Routing Protocols for Direct Multiprocessor Networks , 1995, IEEE Trans. Parallel Distributed Syst..

[17]  Mohamed Ould-Khaoua,et al.  Modelling fully‐adaptive routing in hypercubes , 2000, Telecommun. Syst..