Universal Loop-Free Super-Stabilization

Lélia Blin 1, 2, * Stephane Rovedakis 1, * Maria Potop-Butucaru 3, * Sébastien Tixeuil 2, *
* Corresponding author
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 Paris-Rocquencourt
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.
Complete list of metadatas

Cited literature [28 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00492320
Contributor : Stephane Rovedakis <>
Submitted on : Tuesday, June 15, 2010 - 4:17:33 PM
Last modification on : Thursday, March 21, 2019 - 2:16:10 PM
Long-term archiving on : Wednesday, September 15, 2010 - 8:37:51 PM

Files

SS_generic_LF.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00492320, version 1
  • ARXIV : 1006.3009

Citation

Lélia Blin, Stephane Rovedakis, Maria Potop-Butucaru, Sébastien Tixeuil. Universal Loop-Free Super-Stabilization. 2010. ⟨hal-00492320⟩

Share

Metrics

Record views

452

Files downloads

216