An Efficient Compact Routing Scheme for Interconnection Topologies based on the Random Model

We propose a deadlock-free routing scheme in irregular networks using prefix routing. Prefix routing is a special type of routing with a compact routing table associated with each node (processor). Basically, each outgoing channel of a node is assigned a special label and an outgoing channel is selected if its label is a prefix of the label of the destination node. Node and channel labeling in an irregular network is done through constructing a spanning tree. The routing process follows a two-phase process of going up and then down along the spanning tree, with a possible cross channel (shortcut) between two branches of the tree between two phases. We show that the proposed routing scheme is deadlock- and livelock-free. We also compare prefix routing with the existing up*/down* routing which has been widely used in irregular networks. Possible extensions are also discussed.

Download Full-text

Improved Compact Routing Scheme for Chordal Graphs

Lecture Notes in Computer Science - Distributed Computing ◽

10.1007/3-540-36108-1_17 ◽

2002 ◽

pp. 252-264 ◽

Cited By ~ 9

Author(s):

Yon Dourisboure ◽

Cyril Gavoille

Keyword(s):

Chordal Graphs ◽

Compact Routing ◽

Routing Scheme

Download Full-text

HDLBR: A name-independent compact routing scheme for power-law networks

Computer Communications ◽

10.1016/j.comcom.2012.09.009 ◽

2013 ◽

Vol 36 (3) ◽

pp. 351-359 ◽

Cited By ~ 2

Author(s):

Mingdong Tang ◽

Guoqiang Zhang ◽

Tao Lin ◽

Jianxun Liu

Keyword(s):

Power Law ◽

Compact Routing ◽

Routing Scheme

Download Full-text

On the Hardness of Devising Interval Routing Schemes

Parallel Processing Letters ◽

10.1142/s0129626497000061 ◽

1997 ◽

Vol 07 (01) ◽

pp. 39-47 ◽

Cited By ~ 9

Author(s):

Michele Flammini

Keyword(s):

Time Complexity ◽

Compact Routing ◽

Routing Schemes ◽

Np Completeness ◽

Routing Scheme ◽

Np Complete ◽

Interval Routing ◽

General Networks

The k-Interval Routing Scheme (k-IRS) is a compact routing scheme on general networks. It has been studied extensively and recently been implemented on the latest generation of the INMOS transputer router chips. In this paper we investigate the time complexity of devising a minimal space k-IRS and we prove that the problem of deciding whether there exists a 2-IRS for any network G is NP-complete. This is the first hardness result for k-IRS where k is constant and the graph underlying the network is unweighted. Moreover, the NP-completeness holds also for linear and strict 2-IRS.

Download Full-text