@inproceedings{KieferMOWZ11,
author = {Stefan Kiefer and Andrzej S. Murawski and Jo{\"e}l
Ouaknine and James Worrell and Lijun Zhang},
title = {On Stabilization in {Herman}'s Algorithm},
booktitle = {Automata, Languages and Programming - 38th International
Colloquium (ICALP)},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {6756},
year = 2011,
pages = {466-477},
ee = {http://dx.doi.org/10.1007/978-3-642-22012-8_37},
abstract = {Herman's algorithm is a synchronous randomized protocol for achieving self-stabilization in a token ring consisting of $N$ processes. The interaction of tokens makes the dynamics of the protocol very difficult to analyze. In this paper we study the expected time to stabilization in terms of the initial configuration.
It is straightforward that the algorithm achieves stabilization almost surely from any initial configuration, and it is known that the worst-case expected time to stabilization (with respect to the initial configuration) is $\Theta(N^2)$. Our first contribution is to give an upper bound of $0.64N^2$ on the expected stabilization time, improving on previous upper bounds and reducing the gap with the best existing lower bound. We also introduce an asynchronous version of the protocol, showing a similar $O(N^2)$ convergence bound in this case.
Assuming that errors arise from the corruption of some number $k$ of bits, where $k$ is fixed independently of the size of the ring, we show that the expected time to stabilization is $O(N)$. This reveals a hitherto unknown and highly desirable property of Herman's algorithm: it recovers quickly from bounded errors. We also show that if the initial configuration arises by resetting each bit independently and uniformly at random, then stabilization is significantly faster than in the worst case.}
}