Compact routing schemes with improved stretch

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 (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.

Original languageEnglish
Title of host publicationPODC 2013 - Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing
Pages33-41
Number of pages9
DOIs
StatePublished - 2013
Externally publishedYes
Event2013 ACM Symposium on Principles of Distributed Computing, PODC 2013 - Montreal, QC, Canada
Duration: 22 Jul 201324 Jul 2013

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference2013 ACM Symposium on Principles of Distributed Computing, PODC 2013
Country/TerritoryCanada
CityMontreal, QC
Period22/07/1324/07/13

Keywords

  • Compact routing
  • Name independent routing
  • Stretch factor

Cite this