Issue No. 04 - April (2009 vol. 20)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2008.144
Zhenhai Duan , Florida State University, Tallahassee
Wickus Nienaber , Florida State University, Tallahassee
Xin Yuan , Florida State University, Tallahassee
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.
Interconnection architectures, Network management
Zhenhai Duan, Wickus Nienaber, Xin Yuan, "LID Assignment in InfiniBand Networks", IEEE Transactions on Parallel & Distributed Systems, vol. 20, no. , pp. 484-497, April 2009, doi:10.1109/TPDS.2008.144