Fast routing table construction using small messages

Christoph Lenzen, Boaz Patt-Shamir

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


We describe a distributed randomized algorithm to construct routing tables. Given 0 < ε ≤ 1/2, the algorithm runs in time Õ(n 1/2+ε + HD), where n is the number of nodes and HD denotes the diameter of the network in hops (i.e., as if the network is unweighted). The weighted length of the produced routes is at most O(ε-1 log ε-1) times the optimal weighted length. This is the first algorithm to break the Ω(n) complexity barrier for computing weighted shortest paths even for a single source. Moreover, the algorithm nearly meets the Ω̃(n1/2 + HD) lower bound for distributed computation of routing tables and approximate distances (with optimality, up to polylog factors, for ε = 1/ log n). The presented techniques have many applications, including improved distributed approximation algorithms for Generalized Steiner Forest, all-pairs distance estimation, and estimation of the weighted diameter.

Original languageEnglish
Title of host publicationSTOC 2013 - Proceedings of the 2013 ACM Symposium on Theory of Computing
Number of pages10
StatePublished - 2013
Event45th Annual ACM Symposium on Theory of Computing, STOC 2013 - Palo Alto, CA, United States
Duration: 1 Jun 20134 Jun 2013

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing


Conference45th Annual ACM Symposium on Theory of Computing, STOC 2013
Country/TerritoryUnited States
CityPalo Alto, CA


  • Approximate shortest paths
  • Routing
  • Small messages

All Science Journal Classification (ASJC) codes

  • Software


Dive into the research topics of 'Fast routing table construction using small messages'. Together they form a unique fingerprint.

Cite this