DocumentCode
2891993
Title
Self-stabilization by local checking and correction
Author
Awerbuch, Baruch ; Patt-Shamir, Boaz ; Varghese, George
Author_Institution
Lab. for Comput. Sci., MIT, Cambridge, MA, USA
fYear
1991
fDate
1-4 Oct 1991
Firstpage
268
Lastpage
277
Abstract
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
Keywords
distributed processing; fault tolerant computing; protocols; catastrophic faults; correction; distributed protocols; end-to-end communication protocol; local checking; network reset protocol; self stabilisation; Computer crashes; Computer science; Contracts; Distributed computing; Educational programs; Fault tolerance; Laboratories; Network topology; Protocols; Stability;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on
Conference_Location
San Juan
Print_ISBN
0-8186-2445-0
Type
conf
DOI
10.1109/SFCS.1991.185378
Filename
185378
Link To Document