Fast self-stabilizing minimum spanning tree construction: using compact nearest common ancestor labeling scheme

Authors:
Lélia Blin;Shlomi Dolev;Maria Gradinariu Potop-Butucaru;Stephane Rovedakis
Affiliations:
Université d'Evry-Val d'Essonne, Evry, France and LIP6, CNRS, UMR, France;Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel;Université Pierre & Marie Curie-Paris 6, Paris, France and LIP6, CNRS, UMR, France and INRIA, REGAL, France;Université d'Evry-Val d'Essonne, Evry, France and Laboratoire IBISC, Evry, France
Venue:
DISC'10 Proceedings of the 24th international conference on Distributed computing
Year:
2010

Citing 11
Cited 1

Fast algorithms for finding nearest common ancestors

SIAM Journal on Computing
Self-stabilization

Self-stabilization
A Distributed Algorithm for Minimum-Weight Spanning Trees

ACM Transactions on Programming Languages and Systems (TOPLAS)
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Introduction to Distributed Algorithms

Introduction to Distributed Algorithms
Distributed Algorithms for Reconstructing MST after Topology Change

WDAG '90 Proceedings of the 4th International Workshop on Distributed Algorithms
Self-Stabilizing Minimum Spanning Tree Construction on Message-Passing Networks

DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Self-stabilizing multicast protocols for ad hoc networks

Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
Self-stabilizing extensions for message-passing systems

Distributed Computing - Special issue: Self-stabilization
Self-Stablizing Pivot Interval Routing in General Networks

ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
A new self-stabilizing minimum spanning tree construction with loop-free property

DISC'09 Proceedings of the 23rd international conference on Distributed computing

Fast and compact self stabilizing verification, computation, and fault detection of an MST

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(log2 n) bits and it converges in O(n2) rounds. Thus, this algorithm improves the convergence time of all previously known self-stabilizing asynchronous MST algorithms by a multiplicative factor Θ(n), to the price of increasing the best known space complexity by a factor O(log n). The main ingredient used in our algorithm is the design, for the first time in self-stabilizing settings, of a labeling scheme for computing the nearest common ancestor with only O(log2 n) bits.