Skip to main content
SpringerLink
Log in
Book cover

Latin American Symposium on Theoretical Informatics

LATIN 2000: LATIN 2000: Theoretical Informatics pp 247–257Cite as

A Fully Dynamic Algorithm for Distributed Shortest Paths

  • Conference paper
  • First Online:

  • 1068 Accesses

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

Abstract

We propose a fully-dynamic distributed algorithm for the all-pairs shortest paths problem on general networks with positive real edge weights. If Δσ is the number of pairs of nodes changing the distance after a single edge modification σ (insert, delete, weight-decrease, or weight-increase) then the message complexity of the proposed algorithm is O (nΔσ)in the worst case, where n is the number of nodes of the network. If \(\Delta_{\sigma} = o~(n^2)\), this is better than recomputing everything from scratch after each edge modification.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ahuia, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs (1993)

    Google Scholar 

  2. Ausiello, G., Italiano, G.F., Marchetti-Spaccamela, A., Nanni, U.: Incremental algorithms for minimal length paths. Journal of Algorithms 12(4), 615–638 (1991)

    Article  MathSciNet  Google Scholar 

  3. Awerbuch, B., Cidon, I., Kutten, S.: Communication-optimal maintenance of replicated information. In: Proc. IEEE Symp. on Found. of Comp. Sc., pp. 492–502 (1990)

    Google Scholar 

  4. Frigioni, D., Marchetti-Spaccamela, A., Nanni, U.: Fully dynamic output bounded single source shortest paths problem. In: Proc. ACM-SIAM Symp. on Dis-crete Algorithms, pp. 212–221 (1996); Full version, Journal of Algorithms (to appear)

    Google Scholar 

  5. Haldar, S.: An all pair shortest paths distributed algorithm using 2n 2 messages. Journal of Algorithms 24, 20–36 (1997)

    Article  MathSciNet  Google Scholar 

  6. Humblet, P.: Another adaptive distributed shortest path algorithm. IEEE transactions on communications 39(6), 995–1003 (1991)

    Article  Google Scholar 

  7. Italiano, G.F.: Distributed algorithms for updating shortest paths. In: Toueg, S., Kirousis, L.M., Spirakis, P.G. (eds.) WDAG 1991. LNCS, vol. 579. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  8. McQuillan, J.: Adaptive routing algorithms for distributed computer networks. BBN Rep. 2831, Bolt, Beranek and Newman, Inc., Cambridge (1974)

    Google Scholar 

  9. Moy, J.T.: OSPF - Anatomy of an Internet Routing Protocol. Addison, London (1998)

    Google Scholar 

  10. Ramalingam, G. (ed.): Bounded Incremental Computation. LNCS, vol. 1089. Springer, Heidelberg (1996)

    MATH  Google Scholar 

  11. Ramalingam, G., Reps, T.: On the computational complexity of dynamic graph problems. Theoretical Computer Science 158, 233–277 (1996)

    Article  MathSciNet  Google Scholar 

  12. Ramarao, K.V.S., Venkatesan, S.: On finding and updating shortest paths distributively. Journal of Algorithms 13, 235–257 (1992)

    Article  MathSciNet  Google Scholar 

  13. Tanenbaum, A.S.: Computer networks. Prentice Hall, Englewood Cliffs (1996)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Ingegneria Elettrica, Università dell’Aquila, I-67040, Monteluco di Roio – L’Aquila, Italy

    Serafino Cicerone, Gabriele Di Stefano & Daniele Frigioni

  2. Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”, via Salaria 113, I-00198, Roma, Italy

    Daniele Frigioni & Umberto Nanni

Authors
  1. Serafino Cicerone
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gabriele Di Stefano
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Daniele Frigioni
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Umberto Nanni
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. ETH Zurich, Institute of Computational Science, CH-8092 Zurich and, Swiss Institute of Bioinformatics, Switzerland

    Gaston H. Gonnet

  2. Pedeciba Informática, Casilla de Correo 16120, Distrito 6, Montevideo, Uruguay

    Alfredo Viola

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cicerone, S., Di Stefano, G., Frigioni, D., Nanni, U. (2000). A Fully Dynamic Algorithm for Distributed Shortest Paths. In: Gonnet, G.H., Viola, A. (eds) LATIN 2000: Theoretical Informatics. LATIN 2000. Lecture Notes in Computer Science, vol 1776. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10719839_25

Download citation

  • DOI: https://doi.org/10.1007/10719839_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46415-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation