Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluation

In this paper, we study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem, either (i) work under the assumption that before dealing with an edge operation, the algorithm for the previous operation has to be terminated, that is, they are not able to update shortest paths concurrently, or (ii) concurrently update shortest paths, but their convergence can be very slow (possibly infinite). In this paper we propose a partially dynamic algorithm that overcomes most of these limitations. In particular, it is able to concurrently update shortest paths and in many cases its convergence is quite fast. These properties are highlighted by an experimental study whose aim is to show the effectiveness of the proposed algorithms also in the practical case.

[1]  Giuseppe F. Italiano,et al.  A new approach to dynamic all pairs shortest paths , 2004, JACM.

[2]  J. Moy,et al.  OSPF: Anatomy of an Internet Routing Protocol , 1998 .

[3]  Baruch Awerbuch,et al.  Communication-optimal maintenance of replicated information , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[4]  S. Venkatesan,et al.  On Finding and Updating Shortest Paths Distributively , 1992, J. Algorithms.

[5]  Giuseppe F. Italiano.  Distributed Algorithms for Updating Shortest Paths (Extended Abstract) , 1991, WDAG.

[6]  Ariel Orda,et al.  Distributed shortest-path protocols for time-dependent networks , 1996, Distributed Computing.

[7]  Baruch Awerbuch,et al.  Approximate distributed Bellman-Ford algorithms , 1994, IEEE Trans. Commun..

[8]  Eric C. Rosen,et al.  The Updating Protocol of ARPANET's New Routing Algorithm , 1980, Comput. Networks.

[9]  Daniele Frigioni,et al.  Fully Dynamic Algorithms for Maintaining Shortest Paths Trees , 2000, J. Algorithms.

[10]  Daniele Frigioni,et al.  Partially Dynamic Concurrent Update of Distributed Shortest Paths , 2007, 2007 International Conference on Computing: Theory and Applications (ICCTA'07).

[11]  Pierre A. Humblet,et al.  Another adaptive distributed shortest path algorithm , 1991, IEEE Trans. Commun..

[12]  John M. Mcquillan,et al.  Adaptive routing algorithms for distributed computer networks , 1974 .

[13]  Baruch Awerbuch,et al.  Approximate distributed Bellman-Ford algorithms (computer network routing) , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[14]  Andrew S. Tanenbaum,et al.  Computer Networks , 1981 .

[15]  Daniele Frigioni,et al.  A fully dynamic algorithm for distributed shortest paths , 2003, Theor. Comput. Sci..

[16]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[17]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[18]  Thomas W. Reps,et al.  On the Computational Complexity of Dynamic Graph Problems , 1996, Theor. Comput. Sci..