Route Preserving Stabilization

A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks

“…In addition to being self-stabilizing, a protocol could thus also tolerate a limited number of topology changes (Dolev and Herman 1997), crash faults (Gopal and Perry 1993;Anagnostou and Hadzilacos 1993), nap faults (Dolev and Welch 1997;Papatriantafilou and Tsigas 1997), Byzantine faults (Dolev and Welch 2004;Ben-Or et al 2008), and sustained edge cost changes (Cobb and Gouda 2002;Johnen and Tixeuil 2003). Investigating the possibility to add such properties to our MLST protocol is an intriguing open question.…”

A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property

“…A recent trend in self-stabilizing research is to complement the self-stabilizing abilities of a distributed algorithm with some additional safety properties that are guaranteed when the permanent and intermittent failures that hit the system satisfy some conditions. In addition to being selfstabilizing, a protocol could thus also tolerate a limited number of topology changes [8], crash faults [14,1], nap faults [9,22], Byzantine faults [10,2], and sustained edge cost changes [3,19].…”

“…The algorithm performs roughly as follows: every edge aims at deciding whether it eventually belongs to the MST or not. For this purpose, every non tree-edge e floods the metric size known unique weights memory usage loop-free [17] MST yes yes Θ(n log n) no [18] MST upper bound yes Θ(n log n) no [3] SP upper bound no Θ(log n) yes [19] SP no no Θ(log n) yes This paper MST no no Θ(log n) yes Table 1: Distributed Self-Stabilizing algorithms for the MST and loop-free SP problems network to find a potential cycle, and when e receives its own message back along a cycle, it uses information collected by this message (i.e., the maximum edge weight of the traversed cycle) to decide whether e could potentially be in the MST or not. If the edge e has not received its message back after the time-out interval, it decides to become tree edge.…”

“…Relatively few works investigate merging self-stabilization and loop free routing, with the notable exception of [3,19]. While [3] still requires that a upper bound on the network diameter is known to every participant, no such assumption is made in [19].…”

“…While [3] still requires that a upper bound on the network diameter is known to every participant, no such assumption is made in [19]. Also, both protocols use only a reasonable amount of memory (O(log n) bits per node).…”