Distributed distance computation and routing with small messages

Christoph Lenzen; Boaz Patt-Shamir; David Peleg

doi:10.1007/s00446-018-0326-6

Distributed distance computation and routing with small messages

Christoph Lenzen, Boaz Patt-Shamir, David Peleg

Research output: Contribution to journal › Article › peer-review

17 Scopus citations

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 language	English
Pages (from-to)	133-157
Number of pages	25
Journal	Distributed Computing
Volume	32
Issue number	2
DOIs	https://doi.org/10.1007/s00446-018-0326-6
State	Published - 8 Apr 2019
Externally published	Yes

Bibliographical note

Publisher Copyright:
© 2018, The Author(s).

Keywords

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

Access to Document

10.1007/s00446-018-0326-6

Cite this

@article{91f9ad1da29d4b2d825265ca2ab02ab2,

title = "Distributed distance computation and routing with small messages",

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.",

keywords = "All-pairs shortest paths, CONGEST model, Compact routing, Single-souce shortest paths, Skeleton spanner, Source detection",

author = "Christoph Lenzen and Boaz Patt-Shamir and David Peleg",

note = "Publisher Copyright: {\textcopyright} 2018, The Author(s).",

year = "2019",

month = apr,

day = "8",

doi = "10.1007/s00446-018-0326-6",

language = "אנגלית",

volume = "32",

pages = "133--157",

journal = "Distributed Computing",

issn = "0178-2770",

publisher = "Springer Verlag",

number = "2",

}

TY - JOUR

T1 - Distributed distance computation and routing with small messages

AU - Lenzen, Christoph

AU - Patt-Shamir, Boaz

AU - Peleg, David

PY - 2019/4/8

Y1 - 2019/4/8

N2 - 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.

AB - 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.

KW - All-pairs shortest paths

KW - CONGEST model

KW - Compact routing

KW - Single-souce shortest paths

KW - Skeleton spanner

KW - Source detection

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

U2 - 10.1007/s00446-018-0326-6

DO - 10.1007/s00446-018-0326-6

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:85041910764

SN - 0178-2770

VL - 32

SP - 133

EP - 157

JO - Distributed Computing

JF - Distributed Computing

IS - 2

ER -

Distributed distance computation and routing with small messages

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this