Partially dynamic efficient algorithms for distributed shortest paths

Authors:
Serafino Cicerone;Gianlorenzo DAngelo;Gabriele Di Stefano;Daniele Frigioni
Affiliations:
Dipartimento di Ingegneria Elettrica e dellInformazione, Università degli studi dellAquila, I-67040 Monteluco di Roio, LAquila, Italy;Dipartimento di Ingegneria Elettrica e dellInformazione, Università degli studi dellAquila, I-67040 Monteluco di Roio, LAquila, Italy;Dipartimento di Ingegneria Elettrica e dellInformazione, Università degli studi dellAquila, I-67040 Monteluco di Roio, LAquila, Italy;Dipartimento di Ingegneria Elettrica e dellInformazione, Università degli studi dellAquila, I-67040 Monteluco di Roio, LAquila, Italy
Venue:
Theoretical Computer Science
Year:
2010

Citing 13
Cited 6

Data networks

Data networks
On finding and updating shortest paths distributively

Journal of Algorithms
On the computational complexity of dynamic graph problems

Theoretical Computer Science
Fully dynamic algorithms for maintaining shortest paths trees

Journal of Algorithms
OSPF: Anatomy of an Internet Routing Protocol

OSPF: Anatomy of an Internet Routing Protocol
Distributed Algorithms

Distributed Algorithms
Computer Networks

Computer Networks
Distributed Algorithms for Updating Shortest Paths (Extended Abstract)

WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
A fully dynamic algorithm for distributed shortest paths

Theoretical Computer Science - Latin American theoretical informatics
A new approach to dynamic all pairs shortest paths

Journal of the ACM (JACM)
Distributed shortest-path protocols for time-dependent networks

Distributed Computing
Partially Dynamic Concurrent Update of Distributed Shortest Paths

ICCTA '07 Proceedings of the International Conference on Computing: Theory and Applications
Communication-optimal maintenance of replicated information

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science

A speed-up technique for distributed shortest paths computation

ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part II
A new fully dynamic algorithm for distributed shortest paths and its experimental evaluation

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Engineering a new loop-free shortest paths routing algorithm

SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Enhancing the computation of distributed shortest paths on real dynamic networks

MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Sublinear-Time maintenance of breadth-first spanning tree in partially dynamic networks

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
A loop-free shortest-path routing algorithm for dynamic networks

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

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) due to the looping and counting infinity phenomena. In this paper, we propose partially dynamic algorithms that are able to concurrently update shortest paths. We experimentally analyze the effectiveness and efficiency of our algorithms by comparing them against several implementations of the well-known Bellman-Ford algorithm.