Author :
Afek, Yehuda ; Dolev, Shlomi
Author_Institution :
Dept. of Comput. Sci., Tel Aviv Univ., Israel
Abstract :
A local stabilizer protocol that takes any on-line or of-line distributed algorithm and converts it into a synchronous self-stabilizing algorithm with local monitoring and repairing properties is presented. Whenever the self-stabilizing version enters an inconsistent state, the inconsistency is detected, in O(1) time, and the system state is repaired in a local manner. The expected computation time that is lost during the repair process is proportional to the largest diameter of a faulty region
Keywords :
computational complexity; distributed algorithms; software fault tolerance; system recovery; transport protocols; O(1) time; distributed algorithm; inconsistent state; local monitoring; local repairing properties; local stabilizer protocol; synchronous self-stabilizing algorithm; Art; Computer networks; Computer science; Delay; Distributed algorithms; Frequency synchronization; Mathematics; Monitoring; Protocols; Workstations;
Conference_Titel :
Theory of Computing and Systems, 1997., Proceedings of the Fifth Israeli Symposium on
Conference_Location :
Ramat-Gan
Print_ISBN :
0-8186-8037-7
DOI :
10.1109/ISTCS.1997.595159
