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 approaches 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.

A Self-stabilizing 3-Approximation for the Maximum Leaf Spanning Tree Problem in Arbitrary Networks

“…One of the main recent trends in this topic is to provide self-stabilizing protocols for constrained variants of the spanning tree problem, e.g. [5], [6], [7], etc. None of those metrics give any guarantee on the number of leaves.…”

“…Such costs make T ml includes the MLF. For this layer, we can use one of existing self-stabilizing algorithms, e.g., [6] (The time complexity of [6] is O(n 2 ) rounds. ).…”

Rigorous Performance Evaluation of Self-Stabilization Using Probabilistic Model Checking

“…Once the system reaches such good behavior, typically specified by a set of legitimate states, it remains in this set thereafter in the absence of new faults. The past decades saw the initial concept maturing and spanning various problems [7], [6], [3], [1], and networks [10], [5], [18], [21].…”