A new fully dynamic algorithm for distributed shortest paths and its experimental evaluation

Authors:
Serafino Cicerone;Gianlorenzo D’Angelo;Gabriele Di Stefano;Daniele Frigioni;Vinicio Maurizio
Affiliations:
Dipartimento di Ingegneria Elettrica e dell’Informazione, Università dell’Aquila, L’Aquila, Italy;Dipartimento di Ingegneria Elettrica e dell’Informazione, Università dell’Aquila, L’Aquila, Italy;Dipartimento di Ingegneria Elettrica e dell’Informazione, Università dell’Aquila, L’Aquila, Italy;Dipartimento di Ingegneria Elettrica e dell’Informazione, Università dell’Aquila, L’Aquila, Italy;Dipartimento di Ingegneria Elettrica e dell’Informazione, Università dell’Aquila, L’Aquila, Italy
Venue:
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Year:
2010

Citing 8
Cited 2

Data networks

Data networks
On finding and updating shortest paths distributively

Journal of Algorithms
Loop-free routing using diffusing computations

IEEE/ACM Transactions on Networking (TON)
OSPF: Anatomy of an Internet Routing Protocol

OSPF: Anatomy of an Internet Routing Protocol
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
Distributed shortest-path protocols for time-dependent networks

Distributed Computing
Partially dynamic efficient algorithms for distributed shortest paths

Theoretical 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
Engineering a new loop-free shortest paths routing algorithm

SEA'12 Proceedings of the 11th international conference on Experimental Algorithms

Quantified Score

Hi-index	0.00

Visualization

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.