On the Relative Performance Merits of Switching Techniques Under Bursty Loads

Switching techniques have a strong effect on the performance of interconnection networks. Many studies have shown that traffic loads in parallel computation environments can exhibit burstiness property. In order to obtain a deep understanding of the efficiency of switching techniques, this study proposes an analytical performance model for pipelined circuit switching (PCS) in binary n-cube networks under bursty traffic, which is modeled by a switched Poisson process (SPP). Simulation experiments demonstrate that the proposed model exhibits a good degree of accuracy. This model and the one proposed in Ref. [13] for wormhole switching (WS) are then applied to investigate the relative performance merits of PCS and WS in the presence of bursty loads.

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

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

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

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

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

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

[7]  William J. Dally Virtual-Channel Flow Control , 1992, IEEE Trans. Parallel Distributed Syst..

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