Exact Distance Labelings Yield Additive-Stretch Compact Routing Schemes

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

Compact Routing Schemes for Generalised Chordal Graphs

Journal of Graph Algorithms and Applications ◽

10.7155/jgaa.00109 ◽

2005 ◽

Vol 9 (2) ◽

pp. 277-297 ◽

Cited By ~ 10

Author(s):

Yon Dourisboure

Keyword(s):

Chordal Graphs ◽

Compact Routing ◽

Routing Schemes

Download Full-text

Improved Compact Routing Schemes for Random Interconnects

International Journal of Distributed Systems and Technologies ◽

10.4018/ijdst.2020070105 ◽

2020 ◽

Vol 11 (3) ◽

pp. 89-109

Author(s):

Chi-Hieu Nguyen ◽

Chung T. Kieu ◽

Khanh-Van Nguyen

Keyword(s):

Interconnection Networks ◽

Path Length ◽

Research Area ◽

Global Network ◽

Network Growth ◽

Shortest Path Routing ◽

Compact Routing ◽

Routing Schemes ◽

Routing Table ◽

The Common

Random topology has been an increasingly favorable approach for designing interconnection networks, as it can provide a combination of low latency and incremental network growth that could not be provided by the traditional rigid topologies. However, the common shortest-path routing in a random interconnect poses a scalability problem, for it requires global network info to make routing decisions and so, the routing table size (RTS) can be very large. Therefore, this manuscript would aim to revisit the well-known research area of landmark-based compact routing and to improve the universal routing schemes for the specific case of random interconnects. It would propose new landmark-based compact routing schemes, using 2 heuristic techniques to select landmarks that are evenly spaced, which would reduce the RTS in the well-known Thorup and Zwick's scheme by up to 18% and produce a shorter average path length.

Download Full-text

Compact Routing Schemes

Encyclopedia of Algorithms ◽

10.1007/978-3-642-27848-8_561-1 ◽

2014 ◽

pp. 1-3

Author(s):

Shiri Chechik

Keyword(s):

Compact Routing ◽

Routing Schemes

Download Full-text