Distributed computation of all node replacements of a minimum spanning tree

Authors:
Paola Flocchini;Toni Mesa Enriquez;Linda Pagli;Giuseppe Prencipe;Nicola Santoro
Affiliations:
University of Ottawa, Canada;Universidad de La Habana, Cuba;Università di Pisa, Italy;Carleton University, Canada;Università di Pisa, Italy
Venue:
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Year:
2007

Citing 11
Cited 0

On handling vertex deletion in updating spanning trees

Information Processing Letters
A protocol to maintain a minimum spanning tree in a dynamic topology

SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Verification and sensitivity analysis of minimum spanning trees in linear time

SIAM Journal on Computing
A parallel algorithm for computing minimum spanning trees

Journal of Algorithms
A Distributed Algorithm for Minimum-Weight Spanning Trees

ACM Transactions on Programming Languages and Systems (TOPLAS)
Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures

Algorithmica
A linear-time optimal-message distributed algorithm for minimum spanning trees

Distributed Computing
Design and Analysis of Distributed Algorithms (Wiley Series on Parallel and Distributed Computing)

Design and Analysis of Distributed Algorithms (Wiley Series on Parallel and Distributed Computing)
Point-of-Failure Shortest-Path Rerouting: Computing the Optimal Swap Edges Distributively

IEICE - Transactions on Information and Systems
Optimal MST maintenance for transient deletion of every node in planar graphs

COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Computing all the best swap edges distributively

OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In many network applications the computation takes place on the minimum-cost spanning tree (MST) of the network; unfortunately, a single link or node failure disconnects the tree. In this paper we consider for the first time the problem of computing all the replacement minimum-cost spanning trees distributively, and we efficiently solve the problem. We design a solution protocol and we prove that the total amount of data items communicated during the computation is O(n2). This communication can be achieved either transmitting O(n) long messages, if the system so allows, or O(n2) standard messages. Even in systems that do not allow long messages, the proposed protocol constitutes a significant improvement over the individual computation of the replacement trees.