Computing all the best swap edges distributively
Journal of Parallel and Distributed Computing
Faster Swap Edge Computation in Minimum Diameter Spanning Trees
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Brief Annoucement: Distributed Swap Edges Computation for Minimum Routing Cost Spanning Trees
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Finding best swap edges minimizing the routing cost of a spanning tree
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Self-stabilizing labeling and ranking in ordered trees
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Distributed computation of all node replacements of a minimum spanning tree
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
A distributed algorithm for finding all best swap edges of a minimum diameter spanning tree
DISC'07 Proceedings of the 21st international conference on Distributed Computing
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
Self-stabilizing labeling and ranking in ordered trees
Theoretical Computer Science
Hi-index | 0.00 |
We consider the problem of computing the optimal swap edges of a shortest-path tree. This problem arises in designing systems that offer point-of-failure shortest-path rerouting service in presence of a single link failure: if the shortest path is not affected by the failed link, then the message will be delivered through that path; otherwise, the system will guarantee that, when the message reaches the node where the failure has occurred, the message will then be re-routed through the shortest detour to its destination. 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. We present two simple and efficient distributed algorithms for computing the optimal swap edges of a shortest-path tree. One algorithm uses messages containing a constant amount of information, while the other is tailored for systems that allow long messages. The amount of data transferred by the protocols is the same and depends on the structure of the shortest-path spanning-tree; it is no more, and sometimes significantly less, than the cost of constructing the shortest-path tree.