This Article 
 Bibliographic References 
 Add to: 
On the Space Requirement of Interval Routing
July 1999 (vol. 48 no. 7)
pp. 752-757

Abstract—Interval routing is a space-efficient method for point-to-point networks. It is based on labeling the edges of a network with intervals of vertex numbers (called interval labels). An $M$-label scheme allows up to $M$ labels to be attached on an edge. For arbitrary graphs of size $n$, $n$ the number of vertices, the problem is to determine the minimum $M$ necessary for achieving optimality in the length of the longest routing path. The longest routing path resulted from a labeling is an important indicator of the performance of any algorithm that runs on the network. We prove that there exists a graph with $D=\Omega(n^{\frac{1}{3}})$ such that if $M\leq {\frac{n}{18D}}-O(\sqrt{\frac{n}{D}})$, the longest path is no shorter than $D+\Theta({\frac{D}{\sqrt{M}}})$. As a result, for any $M$-label IRS, if the longest path is to be shorter than $D+\Theta({\frac{D}{\sqrt{M}}})$, at least $M=\Omega({\frac{n}{D}})$ labels per edge would be necessary.

[1] H.L. Bodlaender, R.B. Tan, D.M. Thilikos, and J. van Leeuwen, “On Interval Routing Schemes and Treewidth,” Proc. 21st Graph-Theoretic Concepts in Computer Science (WG '95), pp. 181-186, 1995.
[2] P. Fraigniaud and C. Gavoille, “Interval Routing Schemes,” Algorithmica, vol. 21, pp. 155-182, 1998.
[3] C. Gavoille and E. Guévremont, “Worst Case Bounds for Shortest Path Interval Routing,” J. Algorithms, vol. 27, pp. 1-25, 1998.
[4] C. Gavoille, “On the Dilation of Interval Routing,” Proc. 22nd Int'l Symp. Mathematical Foundations of Computer Science (MFCS '97), pp. 259-268, 1997.
[5] E. Kranakis and D. Krizanc, “Lower Bounds for Compact Routing,” Proc. 13th Ann. Symp. Theoretical Aspects of Computer Science (STACS '96), pp. 529-540, 1996.
[6] E. Kranakis, D. Krizanc, and S.S. Ravi, “On Multi-Label Linear Interval Routing Schemes,” The Computer J., vol. 39, pp. 133-139, 1996.
[7] R. Královic, P. Ruzicka, and D. Stefankovic, “The Complexity of Shortest Path and Dilation Bounded Interval Routing,” Proc. Third Int'l Euro-Par Conf., pp. 258-265, 1997.
[8] P. Ruzicka, “A Note on The Efficiency of An Interval Routing Algorithm,” The Computer J., vol. 34, pp. 475-476, 1991.
[9] N. Santoro and R. Khatib, “Labelling and Implicit Routing in Networks,” The Computer J., vol. 28, pp. 5-8, 1985.
[10] R.B. Tan and J. van Leeuwen, “Compact Routing Methods: A Survey,” Proc. Colloquium Structural Information Information and Comm. Complexity, pp. 99-109, 1994.
[11] S.S.H. Tse and F.C.M. Lau, “A Lower Bound for Interval Routing in General Networks,” Networks, vol. 29, pp. 49-53, 1997.
[12] S.S.H. Tse and F.C.M. Lau, “Lower Bounds for Multi-Label Interval Routing,” Proc. Second Colloquium Structural Information&Comm. Complexity (SIROCCO '95), pp. 123-134, 1995.
[13] S.S.H. Tse and F.C.M. Lau, “An Optimal Lower Bound for Interval Routing in General Networks,” Proc. Fourth Int'l Colloquium Structural Information and Comm. Complexity (SIROCCO'97), pp. 112-124, 1997.
[14] S.S.H. Tse and F.C.M. Lau, “Two Lower Bounds for Mult-Label Interval Routing,” Proc. Computing: The Australasian Theory Symp. (CATS '97), pp. 36-43, 1997.
[15] J. van Leeuwen and R.B. Tan, “Interval Routing,” The Computer J., vol. 30, no. 4, pp. 298-307, Aug. 1987.
[16] Table of Largest (Degree, Diameter)-Graphs, maintained by Dept. of Applied Mathematics and Telematics, Universitat Politècnica de Catalunya, Spain,http://maite71. upc. es/grup_de_grafstable_g. html .

Index Terms:
Compact routing, computational complexity, computer networks, distributed systems, graph theory, interval routing, optimization, shortest paths.
Savio S.H. Tse, Francis C.M. Lau, "On the Space Requirement of Interval Routing," IEEE Transactions on Computers, vol. 48, no. 7, pp. 752-757, July 1999, doi:10.1109/12.780884
Usage of this product signifies your acceptance of the Terms of Use.