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

2013 ◽  
Vol 36 (3) ◽  
pp. 351-359 ◽  
Author(s):  
Mingdong Tang ◽  
Guoqiang Zhang ◽  
Tao Lin ◽  
Jianxun Liu
Keyword(s):  
Power Law ◽  
Compact Routing ◽  
Routing Scheme

A compact routing scheme and approximate distance oracle for power-law graphs

2012 ◽  
Vol 9 (1) ◽  
pp. 1-26 ◽  
Author(s):  
Wei Chen ◽  
Christian Sommer ◽  
Shang-Hua Teng ◽  
Yajun Wang
Keyword(s):  
Power Law ◽  
Compact Routing ◽  
Routing Scheme ◽  
Approximate Distance ◽  
Distance Oracle

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.

On the Hardness of Devising Interval Routing Schemes

1997 ◽  
Vol 07 (01) ◽  
pp. 39-47 ◽  
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.

scholarly journals WMGR: A Generic and Compact Routing Scheme for Data Center Networks

2018 ◽  
Vol 26 (1) ◽  
pp. 356-369 ◽  
Author(s):  
Daniela Aguirre-Guerrero ◽  
Miguel Camelo ◽  
Lluis Fabrega ◽  
Pere Vila
Keyword(s):  
Data Center ◽  
Data Center Networks ◽  
Compact Routing ◽  
Routing Scheme

Compact Routing in Power-Law Graphs

2009 ◽  
pp. 379-391 ◽  
Author(s):  
Wei Chen ◽  
Christian Sommer ◽  
Shang-Hua Teng ◽  
Yajun Wang
Keyword(s):  
Power Law ◽  
Compact Routing
Sign in / Sign up

Export Citation Format

Share Document