The compactness of interval routing for almost all graphs

Cyril Gavoille, David Peleg

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations


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/n2 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.

Original languageEnglish
Title of host publicationDistributed Computing - 12th International Symposium, DISC 1998, Proceedings
EditorsShay Kutten, Shay Kutten
PublisherSpringer Verlag
Number of pages14
ISBN (Print)3540650660, 9783540650669
StatePublished - 1998
Externally publishedYes
Event12th International Symposium on Distributed Computing, DISC 1998 - Andros, Greece
Duration: 24 Sep 199826 Sep 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference12th International Symposium on Distributed Computing, DISC 1998

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1998.


Dive into the research topics of 'The compactness of interval routing for almost all graphs'. Together they form a unique fingerprint.

Cite this