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 journalArticlepeer-review

37 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 minimum cost 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
Article number37
JournalACM Transactions on Algorithms
Volume4
Issue number3
DOIs
StatePublished - 1 Jun 2008

Bibliographical note

Funding Information:
This work was supported in part by a Grant-in-Aid for Scientific Research of Japan Society for the Promotion of Science: KAKENHI (No. 11691202 and No. 11557092 to Hironobu Yanagie), and a Grant-in-Aid from Japan Agency for Medical Research & Development (No. H26-083 to Hironobu Yanagie).

Keywords

  • Compact routing

Fingerprint

Dive into the research topics of 'Compact name-independent routing with minimum stretch'. Together they form a unique fingerprint.

Cite this