Compact name-independent routing with minimum stretch

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

doi:10.1145/1367064.1367077

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 journal › Article › peer-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 language	English
Article number	37
Journal	ACM Transactions on Algorithms
Volume	4
Issue number	3
DOIs	https://doi.org/10.1145/1367064.1367077
State	Published - 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

Access to Document

10.1145/1367064.1367077

Cite this

@article{c9c5daee78f446c18d9d24890d088cfa,

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(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.",

keywords = "Compact routing",

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

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).",

year = "2008",

month = jun,

day = "1",

doi = "10.1145/1367064.1367077",

language = "אנגלית",

volume = "4",

journal = "ACM Transactions on Algorithms",

issn = "1549-6325",

publisher = "Association for Computing Machinery (ACM)",

number = "3",

}

TY - JOUR

T1 - Compact name-independent routing with minimum stretch

AU - Abraham, Ittai

AU - Gavoille, Cyril

AU - Malkhi, Dahlia

AU - Nisan, Noam

AU - Thorup, Mikkel

N1 - 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).

PY - 2008/6/1

Y1 - 2008/6/1

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

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

KW - Compact routing

UR - http://www.scopus.com/inward/record.url?scp=47249105171&partnerID=8YFLogxK

U2 - 10.1145/1367064.1367077

DO - 10.1145/1367064.1367077

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:47249105171

SN - 1549-6325

VL - 4

JO - ACM Transactions on Algorithms

JF - ACM Transactions on Algorithms

IS - 3

M1 - 37

ER -

Compact name-independent routing with minimum stretch

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this