Abstract
In this paper we study the problem of dynamically update all-pairs shortest paths in a distributed network while edge update operations occur to the network. Most of the previous solutions for this problem suffer of two main limitations: they work under the assumption that before dealing with an edge update operation, the algorithm for each previous operation has to be terminated, that is, they are not able to update shortest paths concurrently; they concurrently update shortest paths, but their convergence can be very slow (possibly infinite) due to the well-known looping and count-to-infinity phenomena; they are not suitable to work in the realistic fully dynamic case, where an arbitrary sequence of edge change operations can occur to the network in an unpredictable way.
In this paper, we make a step forward in the area of shortest paths routing, by providing a new fully dynamic solution that overcomes some of the above limitations. In fact, our algorithm is able to concurrently update shortest paths, it heuristically reduces the cases where the looping and count-to-infinity phenomena occur and it is experimentally better than the Bellman-Ford algorithm.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Omnet++: the discrete event simulation environment, http://www.omnetpp.org/
Attiya, H., Welch, J.: Distributed Computing. John Wiley and Sons, Chichester (2004)
Awerbuch, B., Bar-Noy, A., Gopal, M.: Approximate distributed bellman-ford algorithms. IEEE Transactions on Communications 42(8), 2515–2517 (1994)
Bertsekas, D., Gallager, R.: Data Networks. Prentice Hall International, Englewood Cliffs (1992)
Bollobás, B.: Random Graphs. Cambridge University Press, Cambridge (2001)
Cicerone, S., D’Angelo, G., Di Stefano, G., Frigioni, D.: Partially dynamic efficient algorithms for distributed shortest paths. Theoretical Computer Science 411, 1013–1037
Cicerone, S., D’Angelo, G., Di Stefano, G., Frigioni, D., Maurizio, V.: A new fully dynamic algorithm for distributed shortest paths and its experimental evaluation. Technical Report R.10.111, Department of Electrical and Information Engineering, University of L’Aquila (2010)
Cicerone, S., Stefano, G.D., Frigioni, D., Nanni, U.: A fully dynamic algorithm for distributed shortest paths. Theoretical Computer Science 297(1-3), 83–102 (2003)
Garcia-Lunes-Aceves, J.J.: Loop-free routing using diffusing computations. IEEE/ACM Transactions on Networking 1(1), 130–141 (1993)
Humblet, P.A.: Another adaptive distributed shortest path algorithm. IEEE Transactions on Communications 39(6), 995–1002 (1991)
Hyun, Y., Huffaker, B., Andersen, D., Aben, E., Shannon, C., Luckie, M., Claffy, K.: The CAIDA IPv4 routed/24 topology dataset, http://www.caida.org/data/active/ipv4_routed_24_topology_dataset.xml
Italiano, G.F.: Distributed algorithms for updating shortest paths. In: Toueg, S., Kirousis, L.M., Spirakis, P.G. (eds.) WDAG 1991. LNCS, vol. 579, pp. 200–211. Springer, Heidelberg (1992)
McQuillan, J.: Adaptive routing algorithms for distributed computer networks. Technical Report BBN Report 2831, Cambridge, MA (1974)
Moy, J.T.: OSPF - Anatomy of an Internet routing protocol. Addison-Wesley, Reading (1998)
Orda, A., Rom, R.: Distributed shortest-path and minimum-delay protocols in networks with time-dependent edge-length. Distributed Computing 10, 49–62 (1996)
Ramarao, K.V.S., Venkatesan, S.: On finding and updating shortest paths distributively. Journal of Algorithms 13, 235–257 (1992)
Rosen, E.C.: The updating protocol of arpanet’s new routing algorithm. Computer Networks 4, 11–19 (1980)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cicerone, S., D’Angelo, G., Di Stefano, G., Frigioni, D., Maurizio, V. (2010). A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation. In: Festa, P. (eds) Experimental Algorithms. SEA 2010. Lecture Notes in Computer Science, vol 6049. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13193-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-13193-6_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13192-9
Online ISBN: 978-3-642-13193-6
eBook Packages: Computer ScienceComputer Science (R0)