Distributed distance computation and routing with small messages

Christoph Lenzen, Boaz Patt-Shamir, David Peleg

Research output: Contribution to journalArticlepeer-review

Abstract

We consider shortest paths computation and related tasks from the viewpoint of network algorithms, where the n-node input graph is also the computational system: nodes represent processors and edges represent communication links, which can in each time step carry an O(log n) -bit message. We identify several basic distributed distance computation tasks that are highly useful in the design of more sophisticated algorithms and provide efficient solutions. We showcase the utility of these tools by means of several applications.

Original languageEnglish
Pages (from-to)133-157
Number of pages25
JournalDistributed Computing
Volume32
Issue number2
DOIs
StatePublished - 8 Apr 2019

Keywords

  • All-pairs shortest paths
  • CONGEST model
  • Compact routing
  • Single-souce shortest paths
  • Skeleton spanner
  • Source detection

Fingerprint

Dive into the research topics of 'Distributed distance computation and routing with small messages'. Together they form a unique fingerprint.

Cite this