The lower bounds on distributed shortest paths

doi:10.1016/0020-0190(93)90257-A

Information Processing Letters

Volume 48, Issue 3, 19 November 1993, Pages 145-149

https://doi.org/10.1016/0020-0190(93)90257-A Get rights and content

Abstract

The communication complexity of verification and construction of distributed shortest paths is studied and tight lower bounds on the message complexities of these two problems are presented. For both problems, Ω(e) messages are necessary where e is the total number of links in the system.

References (10)

J.M. Abram et al.
A decentralized shortest path algorithm
Proc. 16th Ann. Allerton Conf. on Communication, Control and Computing
(1978)
K.M. Chandy et al.
Distributed computation on graphs: Shortest path algorithms
Comm. ACM
(1982)
C.C. Chen
A distributed algorithm for shortest paths
IEEE Trans. Comput.
(1982)
E.W. Dijstra
A note on two problems in connection with graphs
Numer. Math.
(1959)
G.N. Frederickson
A single source shortest path algorithm for a planar distributed network
Proc. 2nd Ann. Symp. on Theoretical Aspects of Computer Science
(1985)

There are more references available in the full text version of this article.

Cited by (1)

Fault-tolerant computation of distributed regular path queries
2009, Theoretical Computer Science
Regular path queries are the building blocks of almost any mechanism for querying semistructured data. Despite the fact that the main applications of such data are distributed, there are only few works dealing with distributed evaluation of regular path queries. In this paper we present a message-efficient and truly distributed algorithm for computing the answer to regular path queries in a multi-source semistructured database setting. Our algorithm is general as it works for the larger class of weighted regular path queries on weighted semistructured databases.
Also, we show how to make our algorithm fault-tolerant to smoothly work in environments prone to process (or machine) failures. This is very desirable in a grid setting, which is today’s new paradigm of distributed computing, and where one does not have full control over machines that can unexpectedly leave in the middle of computation.

^∗: This research was supported in part by NSF under Grant No. CCR- 9110177, by the Texas Advanced Technology Program under Grant No. 9741-036, and by a grant from Alcatel.

View full text

The lower bounds on distributed shortest paths

Abstract

A decentralized shortest path algorithm

Proc. 16th Ann. Allerton Conf. on Communication, Control and Computing

Distributed computation on graphs: Shortest path algorithms

Comm. ACM

A distributed algorithm for shortest paths

IEEE Trans. Comput.

A note on two problems in connection with graphs

Numer. Math.

A single source shortest path algorithm for a planar distributed network

Proc. 2nd Ann. Symp. on Theoretical Aspects of Computer Science