Compact Routing for Graphs Excluding a Fixed Minor

2005 ◽  
pp. 442-456 ◽  
Author(s):  
Ittai Abraham ◽  
Cyril Gavoille ◽  
Dahlia Malkhi
Keyword(s):  
Compact Routing

scholarly journals DEADLOCK-FREE ROUTING IN IRREGULAR NETWORKS USING PREFIX ROUTING

2003 ◽  
Vol 13 (04) ◽  
pp. 705-720 ◽  
Author(s):  
JIE WU ◽  
LI SHENG
Keyword(s):  
Spanning Tree ◽  
Destination Node ◽  
Two Phase ◽  
Compact Routing ◽  
Routing Scheme ◽  
Routing Table ◽  
Irregular Networks ◽  
Two Phases ◽  
Outgoing Channel ◽  
Prefix Routing

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.

Computer Networks with Compact Routing Tables

The Book of L ◽  
1986 ◽  
pp. 259-273 ◽  
Author(s):  
J. van Leeuwen ◽  
R. B. Tan
Keyword(s):  
Computer Networks ◽  
Compact Routing ◽  
Compact Routing Tables ◽  
Routing Tables
Sign in / Sign up

Export Citation Format

Share Document