Abstract
In this paper we deal with interval routing on n-node networks of diameter D. We show that for every fixed D ≥ 2, there exists a network on which every interval routing scheme with O(n/log n) intervals per link has a routing path length at least [3D/2] - 1. It improves the lower bound on the routing path lengths for the range of very large number of intervals. No result was known about the path lengths when ever more than θ(√n) intervals per link was used. Best-known lower bounds for a small number of intervals are 2D-O(1) for 1 interval [11], and 3D/2 - O(1) up to θ(√n) intervals [5]. For D = 2, we show a network on which any interval routing scheme using less than n/4 - o(n) intervals has a routing path of length at least 3. Moreover, we build a network of bounded degree on which every interval routing scheme with routing path lengths bounded by 3D/2 - o(D) requires Ω(n/log2+ε n) intervals per link, where ε is an arbitrary non-negative constant.
Preview
Unable to display preview. Download preview PDF.
References
M. Flammini and E. Nardelli, On the path length in interval routing schemes. Manuscript, 1996.
P. Fraigniaud and C. Gavoille, Optimal interval routing, in Parallel Processing: CONPAR '94-VAPP VI, B. Buchberger and J. Volkert, eds., vol. 854 of Lecture Notes in Computer Science, Springer-Verlag, Sept. 1994, pp. 785–796.
C. Gavoille and M. Gengler, Space-efficiency of routing schemes of stretch factor three, in 4th Colloquium on Structural Information & Communication Complexity (SIROCCO), July 1997.
C. Gavoille and E. Guévremont, Worst case bounds for shortest path interval routing, Research Report 95-02, LIP, Ecole Normale Superieure de Lyon, 69364 Lyon Cedex 07, France, Jan. 1995.
R. Královič, P. Ružička, and D. Štefankovič, The complexity of shortest path and dilation bounded interval routing, in 3rd International Euro-Par Conference, Aug. 1997.
M. Li and P. M. B. Vitányi, An Introduction to Kotmogorov Complexity and its Applications, Springer-Verlag, 1993.
D. May and P. Thompson, Transputers and routers: Components for concurrent machines, INMOS Ltd., (1990)
P. Ružička, On efficient of interval routing algorithms, in Mathematical Foundations of Computer Science (MFCS), M. Chytil, L. Janiga, and V. Koubek, eds., vol. 324 of Lectures Notes in Computer Science, Springer-Verlag, 1988, pp. 492–500.
N. Santoro and R. Khatib, Labelling and implicit routing in networks, The Computer Journal, 28 (1985), pp. 5–8.
S. S. H. Tse and F. C. M. Lau, Two lower bounds for multi-interval routing, in Computing: The Australasian Theory Symposium (CATS), Sydney, Australia, Feb. 1996.
S. S. H. Tse and F. C. M. Lau, An optimal lower bound for interval routing in general networks, in 4th Colloquium on Structural Information & Communication Complexity (SIROCCO), July 1997.
J. van Leeuwen and R. B. Tan, Interval routing, The Computer Journal, 30 (1987), pp. 298–307.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gavoille, C. (1997). On the dilation of interval routing. In: Prívara, I., Ružička, P. (eds) Mathematical Foundations of Computer Science 1997. MFCS 1997. Lecture Notes in Computer Science, vol 1295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029969
Download citation
DOI: https://doi.org/10.1007/BFb0029969
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63437-9
Online ISBN: 978-3-540-69547-9
eBook Packages: Springer Book Archive