Performance Modelling of Adaptive Routing in Hypercubic Networks under Non-Uniform and Batch Arrival Traffic

Traffic loads have a significant impact on the performance of routing algorithms. Many analytical models for adaptive routing in interconnection networks have been reported. However, most existing studies are based on the assumption that the arrivals of traffic follow a non-bursty Poisson process and the message destinations are uniformly distributed over the network. With the aim of obtaining a deep understanding of network performance under more realistic working conditions, this study develops an analytical performance model for adaptive-routed hypercubic networks under hot-spot and batch arrival traffic. This model adopts the Compound Poisson Process (CPP) to capture the properties of the batch arrival traffic. Extensive simulation experiments are conducted to validate the accuracy of the analytical model.

[1]  Demetres D. Kouvatsos,et al.  Performance modelling of wormhole-routed hypercubes with bursty traffice and finite buffers , 2005 .

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

[3]  Ahmad Khonsari,et al.  A new approach to model virtual channels in interconnection networks , 2007, J. Comput. Syst. Sci..

[4]  Mohamed Ould-Khaoua,et al.  Performance modelling and evaluation of virtual channels in multicomputer networks with bursty traffic , 2004, Perform. Evaluation.

[5]  Hamid Sarbazi-Azad,et al.  An Analytical Model of Adaptive Wormhole Routing in Hypercubes in the Presence of Hot Spot Traffic , 2001, IEEE Trans. Parallel Distributed Syst..

[6]  Irfan-Ullah Awan,et al.  Entropy maximisation and open queueing networks with priorities and blocking , 2003, Perform. Evaluation.

[7]  William J. Dally,et al.  Principles and Practices of Interconnection Networks , 2004 .

[8]  Martin Heusse,et al.  Performance anomaly of 802.11b , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

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

[10]  William J. Dally,et al.  Virtual-channel flow control , 1990, [1990] Proceedings. The 17th Annual International Symposium on Computer Architecture.

[11]  Peter A. Dinda,et al.  The measured network traffic of compiler-parallelized programs , 2001, International Conference on Parallel Processing, 2001..

[12]  Jung-Shyr Wu,et al.  Maximum Entropy Analysis of Open Queueing Networks with Group Arrivals , 1992 .

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

[14]  Hamid Sarbazi-Azad,et al.  Analytical Modeling of Wormhole-Routed k-Ary n-Cubes in the Presence of Hot-Spot Traffic , 2001, IEEE Trans. Computers.

[15]  Hari Balakrishnan,et al.  An analysis of short-term fairness in wireless media access protocols (poster session) , 2000, SIGMETRICS '00.

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

[17]  Claude Castelluccia,et al.  Differentiation mechanisms for IEEE 802.11 , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[18]  Gregory F. Pfister,et al.  “Hot spot” contention and combining in multistage interconnection networks , 1985, IEEE Transactions on Computers.

[19]  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).