Compact routing schemes with improved stretch

Shiri Chechik

doi:https://doi.org/10.1145/2484239.2484268

Compact routing schemes with improved stretch

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We consider the problem of compact routing in weighted general undirected graphs, in which the goal is to construct local routing tables that allow information to be sent on short paths in the network. In this paper the first improvement to the work of Thorup and Zwick [SPAA'01] is presented. Specifically, we construct an improved routing scheme obtaining for every k routing tables of size O (n^1/klog D), and stretch (4 - α) k - β for some absolute constants α, β > 0, where D is the normalized diameter. This provides a positive answer to a main open question in this area as to the existence of a routing scheme with stretch c • k for some constant c < 4.

Original language	English
Title of host publication	PODC 2013 - Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing
Pages	33-41
Number of pages	9
DOIs	https://doi.org/10.1145/2484239.2484268
State	Published - 2013
Externally published	Yes
Event	2013 ACM Symposium on Principles of Distributed Computing, PODC 2013 - Montreal, QC, Canada Duration: 22 Jul 2013 → 24 Jul 2013

Publication series

Name	Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference	2013 ACM Symposium on Principles of Distributed Computing, PODC 2013
Country/Territory	Canada
City	Montreal, QC
Period	22/07/13 → 24/07/13

Keywords

Compact routing
Name independent routing
Stretch factor

All Science Journal Classification (ASJC) codes

Software
Hardware and Architecture
Computer Networks and Communications

Access to Document

https://doi.org/10.1145/2484239.2484268

Cite this

@inproceedings{73495eb5c41e40849e195ce35c5a582e,

title = "Compact routing schemes with improved stretch",

abstract = "We consider the problem of compact routing in weighted general undirected graphs, in which the goal is to construct local routing tables that allow information to be sent on short paths in the network. In this paper the first improvement to the work of Thorup and Zwick [SPAA'01] is presented. Specifically, we construct an improved routing scheme obtaining for every k routing tables of size O (n1/klog D), and stretch (4 - α) k - β for some absolute constants α, β > 0, where D is the normalized diameter. This provides a positive answer to a main open question in this area as to the existence of a routing scheme with stretch c • k for some constant c < 4.",

keywords = "Compact routing, Name independent routing, Stretch factor",

author = "Shiri Chechik",

year = "2013",

doi = "https://doi.org/10.1145/2484239.2484268",

language = "الإنجليزيّة",

isbn = "9781450320658",

series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

pages = "33--41",

booktitle = "PODC 2013 - Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing",

note = "2013 ACM Symposium on Principles of Distributed Computing, PODC 2013 ; Conference date: 22-07-2013 Through 24-07-2013",

}

Chechik, S 2013, Compact routing schemes with improved stretch. in PODC 2013 - Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, pp. 33-41, 2013 ACM Symposium on Principles of Distributed Computing, PODC 2013, Montreal, QC, Canada, 22/07/13. https://doi.org/10.1145/2484239.2484268

TY - GEN

T1 - Compact routing schemes with improved stretch

AU - Chechik, Shiri

PY - 2013

Y1 - 2013

N2 - We consider the problem of compact routing in weighted general undirected graphs, in which the goal is to construct local routing tables that allow information to be sent on short paths in the network. In this paper the first improvement to the work of Thorup and Zwick [SPAA'01] is presented. Specifically, we construct an improved routing scheme obtaining for every k routing tables of size O (n1/klog D), and stretch (4 - α) k - β for some absolute constants α, β > 0, where D is the normalized diameter. This provides a positive answer to a main open question in this area as to the existence of a routing scheme with stretch c • k for some constant c < 4.

AB - We consider the problem of compact routing in weighted general undirected graphs, in which the goal is to construct local routing tables that allow information to be sent on short paths in the network. In this paper the first improvement to the work of Thorup and Zwick [SPAA'01] is presented. Specifically, we construct an improved routing scheme obtaining for every k routing tables of size O (n1/klog D), and stretch (4 - α) k - β for some absolute constants α, β > 0, where D is the normalized diameter. This provides a positive answer to a main open question in this area as to the existence of a routing scheme with stretch c • k for some constant c < 4.

KW - Compact routing

KW - Name independent routing

KW - Stretch factor

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

U2 - https://doi.org/10.1145/2484239.2484268

DO - https://doi.org/10.1145/2484239.2484268

M3 - منشور من مؤتمر

SN - 9781450320658

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 33

EP - 41

BT - PODC 2013 - Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing

T2 - 2013 ACM Symposium on Principles of Distributed Computing, PODC 2013

Y2 - 22 July 2013 through 24 July 2013

ER -

Compact routing schemes with improved stretch

Abstract

Publication series

Conference

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Cite this