Acyclic Strategy for Silent Self-Stabilization in Spanning Forests

Karine Altisen (1) , Stéphane Devismes (2) , Anaïs Durand

1 SYNCHRONE
2 UGA [2016-2019] - Université Grenoble Alpes [2016-2019]

In this paper, we study a general class of algorithms designed for networks endowed with a sense of direction describing a spanning forest (e.g., a directed tree or a network where a directed spanning tree is available) 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 which is polynomial in moves and asymptotically optimal in rounds. To illustrate the versatility of our method, we review several existing works where our results apply.

Mots clés: Self-stabilization; silence; tree networks; bottom-up actions; top-down actions

Domaines: Réseaux et télécommunications [cs.NI]

Karine Altisen, Stéphane Devismes, Anaïs Durand. Acyclic Strategy for Silent Self-Stabilization in Spanning Forests. [Research Report] VERIMAG UMR 5104, Université Grenoble Alpes, France. 2018. ⟨hal-01784570⟩