Skip to main content
SpringerLink
Log in

An ‘All pairs shortest paths’ distributed algorithm using 2n 2 messages

  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 790))

Included in the following conference series:

Abstract

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(n 2 log n) messages, where n is the network size. This paper presents a new distributed algorithm for the same problem using 2n 2 messages in the worst case. This algorithm uses a strategy quite different from those of the other algorithms for the same problem.

This research is partially supported by NWO through NFI Project ALADDIN under Contract Number NF 62–376, and partially by ESPRIT through Project ALCOM II under Basic Research Action Number 7141.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Y. Afek, M. Ricklin: Sparser: A paradigm for running distributed algorithms. Journal of Algorithms 14, 316–328 (1993)

    Google Scholar 

  2. R. Bellman: Dynamic programming. Princeton University Press (1957)

    Google Scholar 

  3. T.H. Cormen, C.E. Leiserson, R.L. Rivest: Introduction to algorithms. MIT Press, Second printing 1990 (Original 1989)

    Google Scholar 

  4. E.W. Dijkstra: A note on two problems in connection with graphs. Numerische mathematik 1, 269–271 (1959)

    Google Scholar 

  5. J. Edmonds: Matroids and the greedy algorithm. Mathematical Programming 1, 126–136 (1971)

    Google Scholar 

  6. R.W. Floyd: Algorithm 97 (Shortest path). Communications of the ACM 5, 345 (1962)

    Google Scholar 

  7. A. Segall: Distributed network protocols. IEEE Trans. on Information Theory 29, 23–35 (1983)

    Google Scholar 

  8. G. Tel: Introduction to distributed algorithms. INF/DOC-92-05, Department of Computer Science, University of Utrecht, The Netherlands (1992)

    Google Scholar 

  9. S. Toueg: An all-pairs shortest-paths distributed algorithm. Tech Rep RC 8327, IBM T.J. Watson Research Center, Yorktown Heights, NY 10598, USA (1980)

    Google Scholar 

  10. S. Warshall: A theorem on boolean matrices. Journal of the ACM 9, 11–12 (1962)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Utrecht University, PO Box 80.089, 3508, TB Utrecht, The Netherlands

    S. Haldar

Authors
  1. S. Haldar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Haldar, S. (1994). An ‘All pairs shortest paths’ distributed algorithm using 2n 2 messages. In: van Leeuwen, J. (eds) Graph-Theoretic Concepts in Computer Science. WG 1993. Lecture Notes in Computer Science, vol 790. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57899-4_65

Download citation

  • DOI: https://doi.org/10.1007/3-540-57899-4_65

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57899-4

  • Online ISBN: 978-3-540-48385-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation