An 'All Pairs Shortest Paths' Distributed Algorithm Using 2n² Messages

In an execution of a distributed program, processes communicate among themselves by exchanging messages. The execution speed of the program could be expedited by a faster message delivery system, transmitting messages to their destinations through their respective shortest paths. Some distributed algorithms have been proposed in recent years for determining all pairs shortest paths for an arbitrary computer network. The best known algorithm usesO(n2logn) messages, wherenis the number of computers in the network. This paper presents a new distributed algorithm for the same problem using 2n2messages in the worst case. This algorithm uses a strategy quite different from those of the other algorithms for the same problem.

[1]  Jack Edmonds,et al.  Matroids and the greedy algorithm , 1971, Math. Program..

[2]  Gerard Tel,et al.  Introduction to Distributed Algorithms: Contents , 2000 .

[3]  K. Mani Chandy,et al.  Distributed computation on graphs: shortest path algorithms , 1982, CACM.

[4]  Stephen Warshall,et al.  A Theorem on Boolean Matrices , 1962, JACM.

[5]  R. Bellman.  Dynamic programming. , 1957, Science.

[6]  Krishnaiyan Thulasiraman,et al.  A Time-Optimal Message-Efficient Distributed Algorithm for Depth-First-Search , 1987, Inf. Process. Lett..

[7]  Yehuda Afek,et al.  Sparser: A Paradigm for Running Distributed Algorithms , 1993, J. Algorithms.

[8]  Israel Cidon.  Yet Another Distributed Depth-First-Search Algorithm , 1988, Inf. Process. Lett..

[9]  S. Haldar,et al.  An 'All Pairs Shortest Path' Distributed Algorithm Using 2n² Messages , 1993, WG.

[10]  Adrian Segall,et al.  A Failsafe Distributed Routing Protocol , 1979, IEEE Trans. Commun..

[11]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[12]  Adrian Segall,et al.  Distributed network protocols , 1983, IEEE Trans. Inf. Theory.

[13]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[14]  Eric C. Rosen,et al.  The New Routing Algorithm for the ARPANET , 1980, IEEE Trans. Commun..

[15]  William D. Tajibnapis,et al.  A correctness proof of a topology information maintenance protocol for a distributed computer network , 1977, CACM.

[16]  Donald B. Johnson,et al.  Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.

[17]  M. Schwartz,et al.  Routing Techniques Used in Computer Communication Networks , 1980, IEEE Trans. Commun..