Subscribe

Issue No.04 - April (2009 vol.20)

pp: 484-497

Wickus Nienaber , Florida State University, Tallahassee

Xin Yuan , Florida State University, Tallahassee

Zhenhai Duan , Florida State University, Tallahassee

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2008.144

ABSTRACT

To realize a path in an InfiniBand network, an address, known as Local IDentifier (LID) in the InfiniBand specification, must be assigned to the destination of the path and used in the forwarding tables of intermediate switches to direct the traffic following the path. Hence, routing in InfiniBand has two components: (1) computing all paths, and (2) assigning LIDs to destinations and using them in intermediate switches to realize the paths. We refer to the task of computing paths as path computation and the task of assigning LIDs as LID assignment. This paper focuses on the LID assignment component, whose major issue is to minimize the number of LIDs required to support a given set of paths. We prove that the problem of realizing a given set of paths with a minimum number of LIDs is NP-complete, develop an integer linear programming formulation for this problem, design a number of heuristics that are effective and efficient in practical cases, and evaluate the performance of the heuristics through simulation. The experimental results indicate that the performance of our best performing heuristic is very close to optimal.

INDEX TERMS

Interconnection architectures, Network management

CITATION

Wickus Nienaber, Xin Yuan, Zhenhai Duan, "LID Assignment in InfiniBand Networks",

*IEEE Transactions on Parallel & Distributed Systems*, vol.20, no. 4, pp. 484-497, April 2009, doi:10.1109/TPDS.2008.144REFERENCES

- [4] J. Duato, S. Yalamanchili, and L. Ni,
Interconnection Networks, An Engineering Approach. Morgan Kaufmann, 2003.- [9]
lp_solve Reference Guide, http://lpsolve.sourceforge.net5.5/, 2008.- [10] InfiniBand Trade Association,
InfiniBand Architecture Specification, Release 1.2, Oct. 2004.- [13] J.C. Sancho, A. Robles, and J. Duato, “A New Methodology to Compute Deadlock-Free Routing Tables for Irregular Networks,”
Proc. Fourth Workshop Comm. Architecture and Applications for Network-Based Parallel Computing, Jan. 2000.- [17] J.Y. Yen, “Finding the $k$ Shortest Loopless Paths in a Network,”
Management Science, vol. 17, no. 11, July 1971.- [19] E.W. Zegura, K. Calvert, and S. Bhattacharjee, “How to Model an Internetwork,”
Proc. IEEE INFOCOM '96, pp. 594-602, Apr. 1996. |