Stochastic Analysis of Deterministic Routing Algorithms in the Presence of Self-Similar Traffic

Many performance models for deterministic routing in multicomputer interconnection networks have been derived and analyzed under the assumption of the traditional Poisson stochastic arrival process, which is inherently unable to capture traffic self-similarity revealed by many real-world parallel applications. In an effort towards understanding the network performance under various traffic loads and different design alternatives, this paper presents an analytical model for dimension-ordered routing in k-ary n-cubes when subjected to self-similar traffic. As the service time, blocking probability and waiting time experienced by a message vary from a dimension to another, the design of such a model for dimension-ordered routing poses greater challenges. The developed analytical model is then used to investigate the efficiency of two different ways to organize virtual channels for deterministic routing and to evaluate the impact of self-similar traffic with various Hurst parameters on network performance.

[1]  José Duato,et al.  A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks , 1993, IEEE Trans. Parallel Distributed Syst..

[2]  Bruno Ciciani,et al.  Performance evaluation of deterministic wormhole routing in k-ary n-cubes , 1998, Parallel Comput..

[3]  Juan-Carlos Cano,et al.  Self-similarity in SPLASH-2 workloads on shared memory multiprocessors systems , 2000, Proceedings 8th Euromicro Workshop on Parallel and Distributed Processing.

[4]  Chita R. Das,et al.  Performance Analysis of Buffering Schemes on Wormhole Routers , 1997, IEEE Trans. Computers.

[5]  Lester Lipsky,et al.  Impact of aggregated, self-similar ON/OFF traffic on delay in stationary queueing models (extended version) , 2001, Perform. Evaluation.

[6]  Walter Willinger,et al.  Self-Similar Network Traffic and Performance Evaluation , 2000 .

[7]  Mary K. Vernon,et al.  Performance Analysis of Mesh Interconnection Networks with Deterministic Routing , 1994, IEEE Trans. Parallel Distributed Syst..

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

[9]  Mohamed Ould-Khaoua,et al.  A performance model for wormhole-switched interconnection networks under self-similar traffic , 2004, IEEE Transactions on Computers.

[10]  Anant Agarwal,et al.  Limits on Interconnection Network Performance , 1991, IEEE Trans. Parallel Distributed Syst..

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

[12]  D. Manjunath,et al.  Input queued switches for variable length packets: analysis for Poisson and self-similar traffic , 2002, Comput. Commun..

[13]  H. Heffes,et al.  A class of data traffic processes — covariance function characterization and related queuing results , 1980, The Bell System Technical Journal.

[14]  Bruno Ciciani,et al.  Performance Analysis of Circuit-Switching Interconnection Networks with Deterministic and Adaptive Routing , 1998, Perform. Evaluation.

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

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

[17]  Walter Willinger,et al.  On the self-similar nature of Ethernet traffic , 1993, SIGCOMM '93.

[18]  H. SARBAZI-AZAD,et al.  Performance Analysis of Deterministic Routing in Workhole k-Ary n-Cubes with Virtual Channels , 2002, J. Interconnect. Networks.

[19]  Walter Willinger,et al.  Self-similarity through high-variability: statistical analysis of Ethernet LAN traffic at the source level , 1997, TNET.

[20]  Mahmut T. Kandemir,et al.  Array regrouping and its use in compiling data-intensive, embedded applications , 2004, IEEE Transactions on Computers.

[21]  William J. Dally,et al.  Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.

[22]  W. Whitt,et al.  The transient BMAP/G/l queue , 1994 .

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

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

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

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

[27]  Bo Friis Nielsen,et al.  A Markovian approach for modeling packet traffic with long-range dependence , 1998, IEEE J. Sel. Areas Commun..