Compact name-independent routing with minimum stretch

Ittai Abraham; Cyril Gavoille; Dahlia Malkhi; Noam Nisan; Mikkel Thorup

doi:10.1145/1007912.1007916

Compact name-independent routing with minimum stretch

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

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to conference › Paper › peer-review

49 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 language	English
Pages	20-24
Number of pages	5
DOIs	https://doi.org/10.1145/1007912.1007916
State	Published - 2004
Event	SPAA 2004 - Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures - Barcelona, Spain Duration: 27 Jun 2004 → 30 Jun 2004

Conference

Conference	SPAA 2004 - Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures
Country/Territory	Spain
City	Barcelona
Period	27/06/04 → 30/06/04

Keywords

Compact Routing

Access to Document

10.1145/1007912.1007916

Cite this

@conference{2d7f96466a374ecb9d3922b4af2b493a,

title = "Compact name-independent routing with minimum stretch",

abstract = "Given a weighted undirected network with arbitrary node names, we present a compact routing scheme, using a {\~O}(√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.",

keywords = "Compact Routing",

author = "Ittai Abraham and Cyril Gavoille and Dahlia Malkhi and Noam Nisan and Mikkel Thorup",

year = "2004",

doi = "10.1145/1007912.1007916",

language = "אנגלית",

pages = "20--24",

note = "SPAA 2004 - Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures ; Conference date: 27-06-2004 Through 30-06-2004",

}

TY - CONF

T1 - Compact name-independent routing with minimum stretch

AU - Abraham, Ittai

AU - Gavoille, Cyril

AU - Malkhi, Dahlia

AU - Nisan, Noam

AU - Thorup, Mikkel

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

KW - Compact Routing

UR - https://www.scopus.com/pages/publications/8344263814

U2 - 10.1145/1007912.1007916

DO - 10.1145/1007912.1007916

M3 - ???researchoutput.researchoutputtypes.contributiontoconference.paper???

AN - SCOPUS:8344263814

SP - 20

EP - 24

T2 - SPAA 2004 - Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures

Y2 - 27 June 2004 through 30 June 2004

ER -

Compact name-independent routing with minimum stretch

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this