Acyclic Strategy for Silent Self-Stabilization in Spanning Forests

Abstract : We formalize design patterns, commonly used in self-stabilization, to obtain general statements regarding both correctness and time complexity. Precisely, we study a class of algorithms devoted to networks endowed with a sense of direction describing a spanning forest whose characterization is a simple (i.e., quasi-syntactic) condition. We show that any algorithm of this class is (1) silent and self-stabilizing under the distributed unfair daemon, and (2) has a stabilization time polynomial in moves and asymptotically optimal in rounds. To illustrate the versatility of our method, we review several works where our results apply.
Complete list of metadatas

Cited literature [7 references]  Display  Hide  Download
Contributor : Anaïs Durand <>
Submitted on : Wednesday, November 28, 2018 - 7:40:20 PM
Last modification on : Monday, December 3, 2018 - 1:39:19 PM


Files produced by the author(s)



Karine Altisen, Stéphane Devismes, Anaïs Durand. Acyclic Strategy for Silent Self-Stabilization in Spanning Forests. SSS 2018 - 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems, Nov 2018, Tokyo, Japan. pp.186-202, ⟨10.1007/978-3-030-03232-6_13⟩. ⟨hal-01938671⟩



Record views


Files downloads