A New Routing Mechanism for Networks with Irregular Topology

Selecting a Pseudo-Hamiltonian cycle in any irregular network and applying a restricted packet injection mechanism to avoid the exhaustion of the storage resources, a new fully adaptive routing algorithm has been developed and tested. Our new routing mechanism outperforms the most relevant routing proposals for networks with irregular topology. In all the tested cases a significant improvement has been obtained. The most spectacular gains were obtained for big networks. For a 512-node network, uniform traffic, and virtual cut-through flow control, our mechanism can outperform, in some cases, the classic up*/down* algorithm by almost a factor of 2.

[1]  Lionel M. Ni,et al.  Adaptive-Trail Routing and Performance Evaluation in Irregular Networks Using Cut-Through Switches , 1999, IEEE Trans. Parallel Distributed Syst..

[2]  Michael Burrows,et al.  Autonet: A High-Speed, Self-Configuring Local Area Network Using Point-to-Point Links , 1991, IEEE J. Sel. Areas Commun..

[3]  Charles L. Seitz,et al.  Myrinet: A Gigabit-per-Second Local Area Network , 1995, IEEE Micro.

[4]  José Duato,et al.  A Necessary and Sufficient Condition for Deadlock-Free Routing in Cut-Through and Store-and-Forward Networks , 1996, IEEE Trans. Parallel Distributed Syst..

[5]  Ludmila Cherkasova,et al.  Fibre channel fabrics: evaluation and design , 1996, Proceedings of HICSS-29: 29th Hawaii International Conference on System Sciences.

[6]  Leonard Kleinrock,et al.  Virtual Cut-Through: A New Computer Communication Switching Technique , 1979, Comput. Networks.

[7]  José Duato,et al.  Adaptive bubble router: a design to improve performance in torus networks , 1999, Proceedings of the 1999 International Conference on Parallel Processing.

[8]  Lawrence Snyder,et al.  The Chaos Router , 1994, IEEE Trans. Computers.

[9]  Antonio Robles,et al.  Efficient Adaptive Routing in Networks of Workstations with Irregular Topology , 1997, CANPC.