A simple distributed algorithm for the maintenance of a spanning tree

Authors:
Brahim Hamid;Bertrand Le Saëc;Mohamed Mosbah
Affiliations:
LaBRI-University of Bordeaux-1, Talence, France;LaBRI-University of Bordeaux-1, Talence, France;LaBRI-University of Bordeaux-1, Talence, France
Venue:
VECoS'07 Proceedings of the First international conference on Verification and Evaluation of Computer and Communication Systems
Year:
2007

Citing 8
Cited 0

Broadcast with partial knowledge (preliminary version)

PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Unreliable failure detectors for reliable distributed systems

Journal of the ACM (JACM)
The maintenance of common data in a distributed system

Journal of the ACM (JACM)
Maintenance of a spanning tree in dynamic networks

Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Introduction to Distributed Algorithms

Introduction to Distributed Algorithms
Revisiting the Paxos Algorithm

WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
Distributed Construction of a Fault-Tolerant Network from a Tree

SRDS '05 Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems
Communication-optimal maintenance of replicated information

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work is devoted to the problem of spanning tree maintenance in the presence of crash failures in a distributed environment using only local knowledge. Using a pre-constructed spanning tree of a k-connected graph, we present a protocol to maintain a spanning tree in the presence of k-1 consecutive failures. The contribution of this paper is twofold. First, the problem is formalized as an occurrence of the Menger's theorem in distributed setting. The second result shows an implementation of the protocol which is composed of a set of modules encoded in the asynchronous message passing model. After each failure occurrence, our algorithm maintains a spanning tree in O(N) time using O(M+N) messages and O(Δ) bits per node. Here Δ is the degree, M the number of edges and N the number of nodes of the graph to be maintained. Furthermore, the studied network is semi-anonymous: Only the root needs to be identified.