Loop-free super-stabilizing spanning tree construction

  • Authors:
  • Lélia Blin;Maria Gradinariu Potop-Butucaru;Stephane Rovedakis;Sébastien Tixeuil

  • Affiliations:
  • Université d'Evry-Val d'Essonne, Evry, France and LIP6, CNRS, UMR, France;Université Pierre & Marie Curie - Paris Paris, France and LIP6, CNRS, UMR, France and INRIA REGAL, France;Université d’Evry-Val d’Essonne, Evry, France and Laboratoire IBISC-EA Evry, France;Université Pierre & Marie Curie - Paris Paris, France LIP6-CNRS UMR France

  • Venue:
  • SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

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.