Loop-Free Super-Stabilizing Spanning Tree Construction - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

Loop-Free Super-Stabilizing Spanning Tree Construction

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.

Dates and versions

hal-00668381 , version 1 (09-02-2012)

Identifiers

Cite

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⟩
157 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More