All k -Bounded Policies Are Equivalent for Self-stabilization

Joffroy Beauquier (1) , Colette Johnen (1) , Stéphane Messika (1)

1 LRI - Laboratoire de Recherche en Informatique

We reduce the problem of proving the convergence of a randomized self-stabilizing algorithm under k-bounded policies to the convergence of the same algorithm under a specific policy. As a consequence, all k-bounded schedules are equivalent: a given algorithm is self-stabilizing under one of them if and only if it is self-stabilizing under any of them.

Domaines: Calcul parallèle, distribué et partagé [cs.DC]

Joffroy Beauquier, Colette Johnen, Stéphane Messika. All k -Bounded Policies Are Equivalent for Self-stabilization. 8th International Symposium, SSS 2006, Nov 2006, Dallas, Texas, United States. pp.82-94, ⟨10.1007/978-3-540-49823-0_6⟩. ⟨hal-00336391⟩