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

In a distributed program execution, 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 uses O(n2 log n) messages, where n is the network size. This paper presents a new distributed algorithm for the same problem using 2n2 messages 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]  Yehuda Afek,et al.  Sparser: A Paradigm for Running Distributed Algorithms , 1993, J. Algorithms.

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

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

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

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

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

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