2013 IEEE 33rd International Conference on Distributed Computing Systems (2006)

Lisboa, Portugal

July 4, 2006 to July 7, 2006

ISSN: 1063-6927

ISBN: 0-7695-2540-7

pp: 75

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDCS.2006.72

Ittai Abraham , Hebrew University of Jerusalem

Cyril Gavoille , University of Bordeaux, Bordeaux, France.

Andrew V. Goldberg , Microsoft Research - Silicon Valley

Dahlia Malkhi , Hebrew University of Jerusalem

ABSTRACT

This paper studies compact routing schemes for networks with low doubling dimension. Two variants are explored, name-independent routing and labeled routing. The key results obtained for this model are the following. First, we provide the first name-independent solution. Specifically, we achieve constant stretch and polylogarithmic storage. Second, we obtain the first truly scale-free solutions, namely, the network?s aspect ratio is not a factor in the stretch. Scale-free schemes are given for three problem models: name-independent routing on graphs, labeled routing on metric spaces, and labeled routing on graphs. Third, we prove a lower bound requiring linear storage for stretch \gt 3 schemes. This has the important ramification of separating for the first time the name-independent problem model from the labeled model for these networks, since compact stretch-1+e labeled schemes are known to be possible.

INDEX TERMS

null

CITATION

Ittai Abraham,
Cyril Gavoille,
Andrew V. Goldberg,
Dahlia Malkhi,
"Routing in Networks with Low Doubling Dimension",

*2013 IEEE 33rd International Conference on Distributed Computing Systems*, vol. 00, no. , pp. 75, 2006, doi:10.1109/ICDCS.2006.72SEARCH