Silent Self-Stabilizing Scheme for Spanning-Tree-like Constructions

Stéphane Devismes (1, 2) , David Ilcinkas (3) , Colette Johnen (3)

1 UGA [2016-2019] - Université Grenoble Alpes [2016-2019]
2 VERIMAG - IMAG - VERIMAG
3 LaBRI - Laboratoire Bordelais de Recherche en Informatique

We propose a general scheme, Algorithm Scheme, to compute spanning-tree-like data structures on arbitrary networks. Scheme is self-stabilizing and silent and, despite its generality, is also efficient. It is written in the locally shared memory model with composite atomicity assuming the distributed unfair daemon, the weakest scheduling assumption of the model. Its stabilization time is in O(n maxCC) rounds, where n maxCC is the maximum number of processes in a connected component. We also exhibit polynomial upper bounds on its stabilization time in steps that depend on the considered precise problem. We illustrate the versatility of our approach by proposing several instantiations of Scheme that efficiently solve classical problems.

Mots clés: spanning tree; self-stabilization; distributed algorithms; leader election; spanning forest

Domaines: Réseaux et télécommunications [cs.NI]; Complexité [cs.CC]; Algorithme et structure de données [cs.DS]

Stéphane Devismes, David Ilcinkas, Colette Johnen. Silent Self-Stabilizing Scheme for Spanning-Tree-like Constructions. 2018. ⟨hal-01667863v3⟩