Proceedings 32nd Annual Symposium of Foundations of Computer Science (1991)
San Juan, Puerto Rico
Oct. 1, 1991 to Oct. 4, 1991
B. Awerbuch , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
B. Patt-Shamir , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
G. Varghese , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
The first self-stabilizing end-to-end communication protocol and the most efficient known self-stabilizing network reset protocol are introduced. A simple method of local checking and correction, by which distributed protocols can be made self-stabilizing without the use of unbounded counters, is used. The self-stabilization model distinguishes between catastrophic faults that abstract arbitrary corruption of global state, and other restricted kinds of anticipated faults. It is assumed that after the execution starts there are no further catastrophic faults, but the anticipated faults may continue to occur.
catastrophic faults, self stabilisation, local checking, correction, end-to-end communication protocol, network reset protocol, distributed protocols
B. Patt-Shamir, G. Varghese and B. Awerbuch, "Self-stabilization by local checking and correction,"  Proceedings 32nd Annual Symposium of Foundations of Computer Science(FOCS), San Juan, Puerto Rico, 1991, pp. 268-277.