Loop-Free Super-Stabilizing Spanning Tree Construction

Lélia Blin 1, 2 Maria Gradinariu Potop-Butucaru 3 Stephane Rovedakis 1 Sébastien Tixeuil 2
IBISC - Informatique, Biologie Intégrative et Systèmes Complexes
2 NPA - Networks and Performance Analysis
LIP6 - Laboratoire d'Informatique de Paris 6
3 Regal - Large-Scale Distributed Systems and Applications
LIP6 - Laboratoire d'Informatique de Paris 6, Inria de Paris
Abstract : We propose an univesal scheme to design loop-free and super-stabilizing protocols for constructing spanning trees optimizing any tree metrics (not only those that are isomorphic to a shortest path tree). Our scheme combines a novel super-stabilizing loop-free BFS with an existing self-stabilizing spanning tree that optimizes a given metric. The composition result preserves the best properties of both worlds: super-stabilization, loop-freedom, and optimization of the original metric without any stabilization time penalty. As case study we apply our composition mechanism to two well known metric-dependent spanning trees: the maximum-flow tree and the minimum degree spanning tree.
Document type :
Conference papers
Complete list of metadatas

Contributor : Frédéric Davesne <>
Submitted on : Thursday, February 9, 2012 - 4:50:59 PM
Last modification on : Thursday, March 21, 2019 - 1:20:26 PM

Links full text



Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil. Loop-Free Super-Stabilizing Spanning Tree Construction. 12th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2010), Sep 2010, New York, NY, United States. pp.50--64, ⟨10.1007/978-3-642-16023-3_7⟩. ⟨hal-00668381⟩



Record views