Improving InfiniBand Routing through Multiple Virtual Networks

InfiniBand is very likely to become the de facto standard for communication between nodes and I/O devices (SANs) as well as for interprocessor communication (NOWs). The InfiniBand Architecture (IBA) defines a switch-based network with point-to-point links whose topology is arbitrarily established by the customer. Often, the interconnection pattern is irregular. Up*/down* is the most popular routing scheme currently used in NOWs with irregular topologies. However, the main drawbacks of up*/down* routing are the unbalanced channel utilization and the difficulties to route most packets through minimal paths, which negatively affects network performance. Using additional virtual lanes can improve up*/down* routing performance by reducing the head-of-line blocking effect, but its use is not aimed to remove its main drawbacks. In this paper, we propose a new methodology that uses a reduced number of virtual lanes in an efficient way to achieve a better traffic balance and a higher number of minimal paths. This methodology is based on routing packets simultaneously through several properly selected up*/down* trees. To guarantee deadlock freedom, each up*/down* tree is built over a different virtual network. Simulation results, show that the proposed methodology increases throughput up to an average factor ranging from 1.18 to 2.18 for 8, 16, and 32-switch networks by using only two virtual lanes. For larger networks with an additional virtual lane, network throughput is tripled, on average.

[1]  Antonio Robles,et al.  Effective strategy to compute forwarding tables for infiniBand networks , 2001, International Conference on Parallel Processing, 2001..

[2]  Antonio Robles,et al.  Analyzing the influence of virtual lanes on the performance of infiniband networks , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[3]  Rich Seifert Gigabit Ethernet , 2001, LCN.

[4]  Antonio Robles,et al.  A Comparison of Router Architectures for Virtual Cut-Through and Wormhole Switching in a NOW Environment , 2001, J. Parallel Distributed Comput..

[5]  C. Minkenberg,et al.  A combined input and output queued packet switched system based on PRIZMA switch on a chip technology , 2000, IEEE Communications Magazine.

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

[7]  José Duato,et al.  Deadlock-Free Routing in InfiniBand through Destination Renaming , 2001 .

[8]  Pedro López,et al.  Combining In-Transit Buffers with Optimized Routing Schemes to Boost the Performance of Networks with Source Routing , 2000, ISHPC.

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

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

[11]  Lionel M. Ni,et al.  Adaptive routing in irregular networks using cut-through switches , 1996, Proceedings of the 1996 ICPP Workshop on Challenges for Parallel Processing.

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

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

[14]  Antonio Robles,et al.  Improving the Up*/Down* Routing Scheme for Networks of Workstations , 2000, Euro-Par.

[15]  Pedro López,et al.  Deadlock-free routing in InfiniBand/sup TM/ through destination renaming , 2001, International Conference on Parallel Processing, 2001..

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

[17]  Antonio Robles,et al.  A New Methodology to Computer Deadlock-Free Routing Tables for Irregular Networks , 2000, CANPC.

[18]  Gregory F. Pfister,et al.  In Search of Clusters , 1995 .