Near-optimal distributed routing with low memory

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

8 Scopus citations


Distributed routing is one of the most central and fundamental problems in the area of Distributed Graph Algorithms. It was extensively studied for almost thirty years. Nevertheless, the currently existing solutions for this problem require either prohibitively large construction (aka preprocessing) time, or prohibitively large memory usage either during the construction or during the routing phase, and suffer from suboptimal labels and tables' sizes. We devise a distributed routing scheme that enjoys the best of all worlds. Specifically, its construction time and memory requirements during the construction phase are near-optimal, and so is also the tradeoff between the sizes of routing tables and labels on the one hand, and the stretch on the other. On the way to this result, we also improve upon existing solutions for the distributed exact tree routing problem. Previous solutions require Ω(n) memory, and provide tables and labels of size O(log n) and O(log2 n), respectively. Our solution, on the other hand, requires just O(log n) memory, and has tables of size O(1), and labels of size O(log n). These bounds match the bounds of the best-known centralized solution.

Original languageEnglish
Title of host publicationPODC 2018 - Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing
PublisherAssociation for Computing Machinery
Number of pages10
ISBN (Print)9781450357951
StatePublished - 23 Jul 2018
Event37th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2018 - Egham, United Kingdom
Duration: 23 Jul 201827 Jul 2018

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing


Conference37th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2018
Country/TerritoryUnited Kingdom


  • Compact routing
  • Congest

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications


Dive into the research topics of 'Near-optimal distributed routing with low memory'. Together they form a unique fingerprint.

Cite this