A New Self-Stabilizing Minimum Spanning Tree Construction with Loop-free Property - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2009

A New Self-Stabilizing Minimum Spanning Tree Construction with Loop-free Property

Abstract

The minimum spanning tree (MST) construction is a classical problem in Distributed Computing for creating a globally minimized structure distributedly. Self-stabilization is versatile technique for forward recovery that permits to handle any kind of transient faults in a unified manner. The loop-free property provides interesting safety assurance in dynamic networks where edge-cost changes during operation of the protocol. We present a new self-stabilizing MST protocol that improves on previous known ap- proaches in several ways. First, it makes fewer system hypotheses as the size of the network (or an upper bound on the size) need not be known to the participants. Second, it is loop-free in the sense that it guarantees that a spanning tree structure is always preserved while edge costs change dynamically and the protocol adjusts to a new MST. Finally, time complexity matches the best known results, while space complexity results show that this protocol is the most efficient to date.
Fichier principal
Vignette du fichier
SS_LF-MST.pdf (405.49 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00384041 , version 1 (14-05-2009)

Identifiers

  • HAL Id : inria-00384041 , version 1
  • ARXIV : 0905.2287

Cite

Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil. A New Self-Stabilizing Minimum Spanning Tree Construction with Loop-free Property. [Research Report] Université d'Evry Val d'Essonne. 2009. ⟨inria-00384041⟩
278 View
294 Download

Altmetric

Share

Gmail Facebook X LinkedIn More