Partially Dynamic Concurrent Update of Distributed Shortest Paths

We study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem 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. The contribution of this paper is twofold and can be summarized as follows. • we show that the incremental algorithm proposed in [5] is able to concurrently update shortest paths in the case of a set of weight decrease and insert operations in O(maxdeg·∆2) messages and O(n) space per node. Here, ∆ is the number of pairs of nodes affected by at least one operation and maxdeg is the maximum degree of a node. • we propose a new decremental algorithm that is able to concurrently update shortest paths in the case of a set of weight increase and delete operations. The algorithm requires O(maxdeg · ∆2) messages and O(maxdeg · n) space per n...

• Type: Conference
• Year: 2007
• Where: ICCTA
• Authors: Gianlorenzo D'Angelo, Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni
• Keywords: Algorithm, Applied Computing, ICCTA 2007, Shortest Paths, Shortest Paths Problem