Incremental algorithms for minimal length paths
Journal of Algorithms
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
On finding and updating shortest paths distributively
Journal of Algorithms
On the computational complexity of dynamic graph problems
Theoretical Computer Science
An “all pairs shortest paths” distributed algorithm using 2n2 messages
Journal of Algorithms
Incremental evaluation of computational circuits
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
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
Computer Networks
Bounded Incremental Computation
Bounded Incremental Computation
Distributed Algorithms for Updating Shortest Paths (Extended Abstract)
WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
Distributed shortest-path protocols for time-dependent networks
Distributed Computing
A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Optimal maintenance of a spanning tree
Journal of the ACM (JACM)
Adaptive algorithms for routing and traffic engineering in stochastic networks
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Partially dynamic efficient algorithms for distributed shortest paths
Theoretical Computer Science
On distributed time-dependent shortest paths over duty-cycled wireless sensor networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
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
A loop-free shortest-path routing algorithm for dynamic networks
Theoretical Computer Science
| Hi-index | 0.00 |
We propose a fully dynamic distributed algorithm for the all-pairs shortest paths problem on general networks with positive real edge weights. If Δσ is the number of pairs of nodes changing the distance after a single edge modification σ (insert, delete, weight decrease, or weight increase) then the message complexity of the proposed algorithm is O(nΔσ) in the worst case, where n is the number of nodes of the network. If Δσ = o(n2), this is better than recomputing everything from scratch after each edge modification. Up to now only a result of Ramarao and Venkatesan was known, stating that the problem of updating shortest paths in a dynamic distributed environment is as hard as that of computing shortest paths.