Silent Self-stabilizing BFS Tree Algorithms Revised

Stéphane Devismes (1) , Colette Johnen (2)

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

In this paper, we revisit two fundamental results of the self-stabilizing literature about silent BFS spanning tree constructions: the Dolev et al algorithm and the Huang and Chen's algorithm. More precisely, we propose in the composite atomicity model three straightforward adaptations inspired from those algorithms. We then present a deep study of these three algorithms. Our results are related to both correctness (convergence and closure, assuming a distributed unfair daemon) and complexity (analysis of the stabilization time in terms of rounds and steps).

Mots clés: composite atomicity model; BFS spanning tree; Self-stabilization; distributed unfair daemon; stabilization time; round and step complexity

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

Stéphane Devismes, Colette Johnen. Silent Self-stabilizing BFS Tree Algorithms Revised. [Research Report] Université Grenoble Alpes. 2015. ⟨hal-01197475⟩