Compact name-independent routing with minimum stretch

Ittai Abraham*, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

46 Scopus citations

Abstract

Given a weighted undirected network with arbitrary node names, we present a compact routing scheme, using a Õ(√n) space routing table at each node, and routing along paths of stretch 3, that is, at most thrice as long as the shortest paths. This is optimal in a very strong sense. It is known that no compact routing using o(n) space per node can route with stretch below 3. Also, it is known that any stretch below 5 requires Ω(√n) space per node.

Original languageAmerican English
Pages20-24
Number of pages5
DOIs
StatePublished - 2004
EventSPAA 2004 - Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures - Barcelona, Spain
Duration: 27 Jun 200430 Jun 2004

Conference

ConferenceSPAA 2004 - Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures
Country/TerritorySpain
CityBarcelona
Period27/06/0430/06/04

Keywords

  • Compact Routing

Cite this