Weak vs. Self vs. Probabilistic Stabilization

10 years 3 months ago
Weak vs. Self vs. Probabilistic Stabilization
Self-stabilization is a strong property which guarantees that a network always resume a correct behavior starting from an arbitrary initial state. Weaker guarantees have later been introduced to cope with impossibility results: probabilistic stabilization only gives probabilistic convergence to a correct behavior. Also, weak-stabilization only gives the possibility of convergence. In this paper, we investigate the relative power of weak, self, and probabilistic stabilization, with respect to the set of problems that can be solved. We formally prove that in that sense, weak stabilization is strictly stronger that selfstabilization. Also, we refine previous results on weak stabilization to prove that, for practical schedule instances, a deterministic weak-stabilizing protocol can be turned into a probabilistic self-stabilizing one. This latter result hints at more practical use of weak-stabilization, as such algorithms are easier to design and prove than their (probabilistic) selfstabi...
Stéphane Devismes, Sébastien Tixeuil
Added 30 May 2010
Updated 30 May 2010
Type Conference
Year 2008
Authors Stéphane Devismes, Sébastien Tixeuil, Masafumi Yamashita
Comments (0)