A Simple DFS-Based Algorithm for Linear Interval Routing

Linear Interval Routing is a space-efficient routing method for point-to-point communication networks. It is a restricted variant of Interval Routing where the routing range associated with every link is represented by an interval with no wrap-around. It was noted in [BLT91] that not every network has a valid Linear Interval Labeling Scheme (LILS). A complete characterization of the networks that admit a valid LILS was presented in [FG94], together with an algorithm that generates a valid LILS in case one exists. We present a new algorithm that generates an LILS for every network that admits one. Our algorithm is based on a DFS spanning tree of the network, and is “in the spirit” of the algorithms for Interval Routing. Our algorithm has few advantages over the algorithm of [FG94]: it utilizes the well-known theory of DFS spanning trees and is thus simpler to understand and to implement, it uses all links of the network for routing (thus it better distributes the load), and it guarantees that some paths traversed by messages are shortest length paths.

[1]  Grzegorz Rozenberg,et al.  The Book of L , 1986, Springer Berlin Heidelberg.

[2]  Pierre Fraigniaud,et al.  Local memory requirement of universal routing schemes , 1996, SPAA '96.

[3]  Giorgio Gambosi,et al.  Boolean Routing , 1993, WDAG.

[4]  Richard B. Tan,et al.  Computer Networks with Compact Routing Tables , 1986 .

[5]  Peter Ruzicka,et al.  A Note on the Efficiency of an Interval Routing Algorithm , 1991, Comput. J..

[6]  Nicola Santoro,et al.  Labelling and Implicit Routing in Networks , 1985, Computer/law journal.

[7]  Richard B. Tan,et al.  Routing with compact routing tables , 1983 .

[8]  Francis C. M. Lau,et al.  A lower bound for interval routing in general networks , 1997, Networks.

[9]  Cyril Gavoille,et al.  Memory Requirements for Routing in Distributed Networks (Extended Abstract). , 1996, PODC 1996.

[10]  Erwin M. Bakker,et al.  Linear Interval Routing , 1991 .

[11]  Stéphane Pérennes,et al.  Lower Bounds for Shortest Path Interval Routing , 1996, SIROCCO.

[12]  Shmuel Zaks,et al.  A Lower Bound for Linear Interval Routing , 1996, WDAG.

[13]  Shimon Even,et al.  Graph Algorithms , 1979 .

[14]  Richard B. Tan,et al.  Multi-Dimensional Interval Routing Schemes , 1995, WDAG.

[15]  Pierre Fraigniaud,et al.  Optimal Interval Routing , 1994, CONPAR.

[16]  Eli Upfal,et al.  A trade-off between space and efficiency for routing tables , 1989, JACM.

[17]  S. Zaks,et al.  Lower bounds for linear interval routing , 1999, Networks.

[18]  Baruch Awerbuch,et al.  Routing with Polynomial Communication-Space Trade-Off , 1992, SIAM J. Discret. Math..

[19]  Baruch Awerbuch,et al.  Improved Routing Strategies with Succinct Tables , 1990, J. Algorithms.

[20]  Pierre Fraigniaud,et al.  Interval Routing Schemes , 1998, Algorithmica.