Abstract
Interval routing is a compact way for representing routing tables on a graph. It is based on grouping together, in each node, destination addresses that use the same outgoing edge in the routing table. Such groups of addresses are represented by some intervals of consecutive integers. We show that almost all the graphs, i.e., a fraction of at least 1− 1/n 2 of all the n-node graphs, support a shortest path interval routing with at most three intervals per outgoing edge, even if the addresses of the nodes are arbitrarily fixed in advance and cannot be chosen by the designer of the routing scheme. In case the addresses are initialized randomly, we show that two intervals per outgoing edge suffice, and conversely, that two intervals are required, for almost all graphs. Finally, if the node addresses can be chosen as desired, we show how to design in polynomial time a shortest path interval routing with a single interval per outgoing edge, for all but at most O(log3 n) outgoing edges in each node. It follows that almost all graphs support a shortest path routing scheme which requires at most n + O(log4 n) bits of routing information per node, improving on the previous upper bound.
Supported in part by grants from the Israel Science Foundation and from the Israel Ministry of Science and Art.
Preview
Unable to display preview. Download preview PDF.
References
N. Alon and J. H. Spencer, The Probabilistic Method, John Wiley & Sons, 1992.
B. Bollobás, Random Graphs, Academic Press, New York, 1975.
H. Buhrman, J.-H. Hoepman, and P. Vitányi, Optimal routing tables, in 15th Annual ACM Symposium on Principles of Distributed Computing (PODC), May 1996.
H. Buhrman, M. Li, and P. Vitányi, Kolmogorov random graphs and the incompressibility method, in IEEE Conference on Compression and Complexity of Sequences, IEEE Comp. Soc. Press, 1997.
M. Flammini, J. van Leeuwen, and A. Marchetti-Spaccamela, The complexity of interval routing on random graphs, in 20th International Symposium on Mathematical Foundations of Computer Sciences (MFCS), J. Wiederman and P. Hájek, eds., vol. 969 of Lecture Notes in Computer Science, Springer-Verlag, Aug. 1995, pp. 37–49.
C. Gavoille, A survey on interval routing scheme, Research Report RR-1182-97, LaBRI, University of Bordeaux, 351, cours de la Libération, 33405 Talence Cedex, France, Oct. 1997. Submitted for publication.
C. Gavoille and D. Peleg, The compactness of interval routing, Research Report RR-1176-97, LaBRI, University of Bordeaux, 351, cours de la Libération, 33405 Talence Cedex, France, Sept. 1997. Submitted for publication.
C. Gavoille and S. Pérennés, Memory requirement for routing in distributed networks, in 15th Annual ACM Symposium on Principles of Distributed Computing (PODC), ACM PRESS, ed., May 1996, pp. 125–133.
N. Santoro and R. Khatib, Labelling and implicit routing in networks, The Computer Journal, 28 (1985), pp. 5–8.
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
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gavoille, C., Peleg, D. (1998). The compactness of interval routing for almost all graphs. In: Kutten, S. (eds) Distributed Computing. DISC 1998. Lecture Notes in Computer Science, vol 1499. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056481
Download citation
DOI: https://doi.org/10.1007/BFb0056481
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65066-9
Online ISBN: 978-3-540-49693-9
eBook Packages: Springer Book Archive