A distributed algorithm for edge-disjoint path problem
Proc. of the sixth conference on Foundations of software technology and theoretical computer science
A new distributed algorithm to find breadth first search trees
IEEE Transactions on Information Theory
The multi-tree approach to reliability in distributed networks
Information and Computation
Sparser: a paradigm for running distributed algorithms
Journal of Algorithms
Distributed computation on graphs: shortest path algorithms
Communications of the ACM
New dynamic algorithms for shortest path tree computation
IEEE/ACM Transactions on Networking (TON)
Nearest common ancestors: a survey and a new distributed algorithm
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Computer Networks: A Systems Approach, 3rd Edition
Computer Networks: A Systems Approach, 3rd Edition
| Hi-index | 0.01 |
We consider the problem of computing the best swap edges of a shortest-path tree Trrooted in r. That is, given a single link failure: if the path is not affected by the failed link, then the message will be delivered through that path; otherwise, we want to guarantee that, when the message reaches the edge (u,v) where the failure has occurred, the message will then be re-routed using the computed swap edge. There exist highly efficient serial solutions for the problem, but unfortunately because of the structures they use, there is no known (nor foreseeable) efficient distributed implementation for them. A distributed protocol exists only for finding swap edges, not necessarily optimal ones. In [6], distributed solutions to compute the swap edge that minimizes the distance from u to r have been presented. In contrast, in this paper we focus on selecting, efficiently and distributively, the best swap edge according to an objective function suggested in [13]: we choose the swap edge that minimizes the distance from u to v.