Layered routing in irregular networks

Lysne, Olav; Skeie, Tor; Reinemo, Sven-Arne; Theiss, I.

doi:10.1109/tpds.2006.12

Cited by 109 publications

(34 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our LID assignment schemes do not make any assumption about path computation and can work with any routing schemes including multi-path routing, non dead-lock free routing, and other path computation schemes such as the recently developed layered routing scheme [11]. However, the paths computed with different schemes may exhibit different characteristics, which may affect the effectiveness of the LID assignment heuristics.…”

Section: Performance Studymentioning

confidence: 99%

On LID assignment in infiniBand networks

Nienaber

Yuan

Duan

2007

Proceedings of the 3rd ACM/IEEE Symposium on Architecture for Networking and Communications Systems

View full text Add to dashboard Cite

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 NPcomplete, 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. We further demonstrate that by separating path computation from LID assignment and using the schemes that are known to achieve good performance for path computation and LID assignment separately, more effective routing schemes than existing ones can be developed.

show abstract

Section: Performance Studymentioning

confidence: 99%

On LID assignment in infiniBand networks

Nienaber

Yuan

Duan

2007

Proceedings of the 3rd ACM/IEEE Symposium on Architecture for Networking and Communications Systems

View full text Add to dashboard Cite

show abstract

“…Without a careful design for routing scheme of INs, deadlock may happen in these networks [5,6]. Since the topology of INs is not predefined, designing and applying deadlock-free routing algorithms are usually done without any pre-assumption about the network topology.…”

Section: Introductionmentioning

confidence: 99%

The Effect of Network Topology and Channel Labels on the Performance of Label-Based Routing Algorithms

Moraveji

Sarbazi-Azad

Tavakkol

2008

Computational Science – ICCS 2008

View full text Add to dashboard Cite

Abstract. Designing an efficient deadlock-free routing is a point of concern for irregular topologies. In this paper, we take a step toward the goal by developing three novel deadlock-free routing algorithms in the content of a new family of algorithms called label-based routing algorithms for irregular topologies. In addition, the newly proposed family covers three previously reported routing algorithms [2,3]. Moreover, by simulating and comparing the newly and traditional proposed routing methods, it is shown that the performance of this family highly depends on the network topology and channel labeling process.

show abstract

“…In [17,22], authors implemented a layered shortest path routing algorithm, LASH, where a number of virtual paths were used to break cycles in their simulated NOW clusters. In their model, layers contain only unidirectional paths where path assignment is done in a way to prevent cycle formation.…”

Section: Introductionmentioning

confidence: 99%

A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph

Levitin¹,

Karpovsky²,

Mustafa³

et al. 2006

JGAA

View full text Add to dashboard Cite

We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in computer and communication networks, such as Networks of Workstations. The proposed Cycle Breaking algorithm, or CB algorithm, guarantees that the constructed set of prohibited turns is minimal and that the fraction of the prohibited turns does not exceed 1/3 for any graph. The computational complexity of the proposed algorithm is O(N 2 ∆), where N is the number of vertices, and ∆ is the maximum node degree. The memory complexity of the algorithm is O(N ∆).We provide lower bounds on the minimum size of cycle-breaking sets for connected graphs. Further, we construct minimal cycle-breaking sets and establish bounds on the minimum fraction of prohibited turns for two important classes of graphs, namely, t-partite graphs and graphs with small degrees. The upper bounds are tight and demonstrate the optimality of the CB algorithm for certain classes of graphs. Results of computer simulations illustrate the superiority of the proposed CB algorithm as compared to the well-known and the widely used Up/Down technique.

show abstract

Layered routing in irregular networks

Cited by 109 publications

References 16 publications

On LID assignment in infiniBand networks

On LID assignment in infiniBand networks

The Effect of Network Topology and Channel Labels on the Performance of Label-Based Routing Algorithms

A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph

Contact Info

Product

Resources

About