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
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.144
REFERENCES
 [1] A. Bermudez, R. Casado, F.J. Quiles, T.M. Pinkston, and J. Duato, “Evaluation of a Subnet Management Mechanism for InfiniBand Networks,” Proc. 32nd Int'l Conf. Parallel Processing (ICPP '03), pp.117-124, Oct. 2003. [2] A. Bermudez, R. Casado, F.J. Quiles, and J. Duato, “Use of Provisional Routes to Speed-Up Change Assimilation in InfiniBand, Networks,” Proc. Workshop Comm. Architecture for Clusters (CAC '04), p. 186, Apr. 2004. [3] A. Bermudez, R. Casado, F.J. Quiles, and J. Duato, “Fast Routing Computation on InfiniBand Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 17, no. 3, pp. 215-226, Mar. 2006. [4] J. Duato, S. Yalamanchili, and L. Ni, Interconnection Networks, An Engineering Approach. Morgan Kaufmann, 2003. [5] C. Gomez, F. Gilabert, M.E. Gomez, P. Lopez, and J. Duato, “Deterministic versus Adaptive Routing in Fat-Trees,” Proc. Workshop Comm. Architecture for Clusters (CAC '07), pp. 1-8, Apr. 2007. [6] M. Koibuchi, A. Funahashi, A. Jouraku, and H. Amano, “L-Turn Routing: An Adaptive Routing in Irregular Networks,” Proc. Int'l Conf. Parallel Processing (ICPP '01), pp. 383-392, Sept. 2001. [7] X. Lin, Y. Chung, and T. Huang, “A Multiple LID Routing Scheme for Fat-Tree-Based InfiniBand Networks,” Proc. 18th IEEE Int'l Parallel and Distributed Processing Symp. (IPDPS '04), p. 11a, Apr. 2004. [8] P. Lopez, J. Flich, and J. Duato, “Deadlock-Free Routing in InfiniBand through Destination Renaming,” Proc. Int'l Conf. Parallel Processing (ICPP '01), pp. 427-434, Sept. 2001. [9] lp_solve Reference Guide, http://lpsolve.sourceforge.net5.5/, 2008. [10] InfiniBand Trade Association, InfiniBand Architecture Specification, Release 1.2, Oct. 2004. [11] O. Lysne, T. Skeie, S. Reinemo, and I. Theiss, “Layered Routing in Irregular Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 17, no. 1, pp. 51-65, Jan. 2006. [12] M. Koibuchi, A. Jouraku, and H. Amano, “Path Selection Algorithm: The Strategy for Designing Deterministic Routing from Alternative Paths,” Parallel Computing, vol. 31, no. 1, pp.117-130, 2005. [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. [14] J.C. Sancho, A. Robles, and J. Duato, “Effective Strategy to Computing Forwarding Tables for InfiniBand Networks,” Proc. Int'l Conf. Parallel Processing (ICPP '01), pp. 48-57, Sept. 2001. [15] J.C. Sancho, A. Robles, and J. Duato, “Effective Methodology for Deadlock-Free Minimal Routing in InfiniBand Networks,” Proc. Int'l Conf. Parallel Processing (ICPP '02), pp. 409-418, 2002. [16] M.D. Schroeder, A.D. Birrell, M. Burrow, H. Murray, R.M. Needham, and T.L. Rodeheffer, “Autonet: A High-Speed Self-Configuring Local Area Network Using Point-to-Point Links,” IEEE J. Selected Areas in Comm., vol. 9, no. 8, pp.1318-1335, 1991. [17] J.Y. Yen, “Finding the $k$ Shortest Loopless Paths in a Network,” Management Science, vol. 17, no. 11, July 1971. [18] X. Yuan, W. Nienaber, Z. Duan, and R. Melhem, “Oblivious Routing for Fat-Tree Based System Area Networks with Uncertain Traffic Demands,” Proc. ACM SIGMETRICS '07, pp. 337-348, June 2007. [19] E.W. Zegura, K. Calvert, and S. Bhattacharjee, “How to Model an Internetwork,” Proc. IEEE INFOCOM '96, pp. 594-602, Apr. 1996.