 
Summary: Local Stabilizer \Lambda
Yehuda Afek y Shlomi Dolev z
Abstract
A local stabilizer protocol that takes any online or offline distributed algorithm and
converts it into a synchronous selfstabilizing algorithm with local monitoring and repairing
properties is presented. Whenever the selfstabilizing version enters an inconsistent state,
the inconsistency is detected, in O(1) time, and the system state is repaired in a local man
ner. The expected computation time that is lost during the repair process is proportional
to the largest diameter of a faulty region.
\Lambda An extended abstract of this paper appeared in the Proc. of the 5th Israeli Symposium on Theory of
Computing and Systems, June 1997 and a brief announcement in Proc. of the 16th Annual ACM Symp. on
Principles of Distributed Computing, August 1997.
y Computer Science Department, TelAviv University, TelAviv, 69978, Israel. Email: afek@math.tau.ac.il.
z Department of Mathematics and Computer Science, BenGurion University, BeerSheva, 84105, Israel.
Partially supported by the Israeli ministry of science and arts grant #6756195. Email: dolev@cs.bgu.ac.il.
1 Introduction
This paper presents a method that takes an arbitrary distributed algorithm and produces its
fast synchronous selfstabilizing version. The expected stabilization time of the resulting al
gorithm is linear in the diameter of the largest part of the network that is corrupted. Several
