Some of the material in is restricted to members of the community. By logging in, you may be able to gain additional access to certain collections or items. If you have questions about access or logging in, please use the form on the Contact Page.
In addition to requiring routing to be dead-lock free and deterministic, Infiniband networks adopt destination based routing, which further complicates the routing design by putting additional constraints on the paths that can be supported by the networks. To realize a routing in an Infiniband network, the system may need to allocate multiple addresses, known as LIDs in the Infiniband specification, to an end node, and compute the forwarding tables with these LIDs. Since LIDs are limited resources, it is desirable to develop a scheme that can realize any given routing with a minimum number of LIDs. The {em LID allocation and assignment problem} refers to the problem of realizing a routing with a minimum number of LIDs. In this paper, we show that the LID allocation and assignment problem is NP-complete. We develop a number of heuristics for this problem and evaluate the proposed heuristics through simulation. The results show that combining the proposed LID allocation and assignment heuristics with better route selection algorithms, better network load balancing can be achieved with a smaller number of LIDs in comparison to using traditional routing and LID allocation and assignment methods for Infiniband networks.
This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s). The copyright in theses and dissertations completed at Florida State University is held by the students who author them.
