Fast Self-Stabilizing Minimum Spanning Tree Construction

Lélia Blin (1) , Shlomi Dolev (2) , Maria Potop-Butucaru (3, 4) , Stephane Rovedakis (1)

1 IBISC - Informatique, Biologie Intégrative et Systèmes Complexes
2 Department of Computer Science [Beer-Sheva]
3 LIP6 - Laboratoire d'Informatique de Paris 6
4 Regal - Large-Scale Distributed Systems and Applications

We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is $O(\log^2n)$ bits and it converges in $O(n^2)$ rounds. Thus, this algorithm improves the convergence time of all previously known self-stabilizing asynchronous MST algorithms by a multiplicative factor $\Theta(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(\log^2n)$ bits.

Domaines: Calcul parallèle, distribué et partagé [cs.DC]; Algorithme et structure de données [cs.DS]; Réseaux et télécommunications [cs.NI]

Lélia Blin, Shlomi Dolev, Maria Potop-Butucaru, Stephane Rovedakis. Fast Self-Stabilizing Minimum Spanning Tree Construction. 2010. ⟨hal-00492398v1⟩