A useful way to design simple and robust protocols is to make them self-stabilizing. A protocol is said to be self-stabilizing if it begins to exhibit correct behavior even after starting in an arbitrary state. We describe a simple technique for self-stabilization called counter flushing which is applicable to a number of distributed algorithms. We show how our technique helps to understand and improve some previous distributed algorithms. We also apply it to create new self-stabilizing protocols for propagation of information with feedback and resets. The resulting protocols are simple, require few changes from the non-stabilizing equivalents, and have fast stabilization times.
|
806
|
The Byzantine generals problem
– Lamport, Shostack, et al.
- 1982
|
|
449
|
Self-Stabilizing Systems in Spite of Distributed Control
– Dijkstra
- 1974
|
|
381
|
M.: An Introduction to Input/Output automata
– Lynch, Tuttle
- 1989
|
|
230
|
Introduction to Distributed Algorithms
– Tel
- 1994
|
|
145
|
Self Stabilization of Dynamic Systems Assuming Only Read/Write Atomicity
– Dolev, Moran, et al.
- 1990
|
|
137
|
Network layer protocols with Byzantine robustness
– Perlman
- 1988
|
|
119
|
Distributed reset
– Arora, Gouda
- 1994
|
|
108
|
Distributed network protocols
– Segall
- 1983
|
|
104
|
Self-stabilization by local checking and correction
– Awerbuch, Patt-Shamir, et al.
- 1991
|
|
103
|
Self-stabilizing extensions for message-passing systems
– Katz, Perry
- 1993
|
|
69
|
Applying static network protocols to dynamic networks
– Afek, Awerbuch, et al.
- 1987
|
|
67
|
Computer Networks
– Tannenbaum
- 1998
|
|
64
|
Self stabilization in spite of distributed control
– Dijkstra
- 1974
|
|
59
|
Echo algorithms: Depth parallel operations on general graphs
– Chang
- 1982
|
|
57
|
Time Optimal Self-Stabilizing Synchronization
– Awerbuch, Kutten, et al.
- 1993
|
|
55
|
Time optimal self-stabilizing spanning tree algorithm
– Aggarwal, Kutten
- 1993
|
|
51
|
Fault-tolerant broadcast of routing information
– Perlman
- 1983
|
|
41
|
Resynch Procedures and a Fail-Safe Network Protocol
– Finn
- 1979
|
|
30
|
Fast and lean self-stabilizing asynchronous protocols
– Itkis, Levin
- 1994
|
|
29
|
Resource Bounds for Self Stabilization Message Driven Protocols
– Dolev, Israeli, et al.
- 1991
|
|
28
|
Self-stabilization over unreliable communication media
– Afek, Brown
- 1993
|
|
24
|
Vulnerabilities of Network Control Protocols: An Example
– Rosen
- 1981
|
|
22
|
Constraint satisfaction as a basis for designing nonmasking faulttolerance
– Arora, Gouda, et al.
- 1996
|
|
11
|
Self-stabilization by local checking and correction (Ph.D. thesis
– Varghese
- 1993
|
|
7
|
Optimal Time Self-Stabilization in Uniform Dynamic Systems
– Dolev
- 1998
|
|
7
|
Reliable communication
– Spinelli
- 1988
|
|
6
|
Self-stabilization by window washing
– Costello, Varghese
- 1996
|
|
2
|
A formal approach to a communication-network protocol; broadcast as a case study
– Awerbuch, Even
- 1983
|
|
1
|
A formal approach toacommunication-network protocol� broadcast as a case study
– Awerbuch, Even
- 1983
|
|
1
|
satisfaction as a basis for designing nonmasking fault-tolerance
– Constraint
- 1994
|
|
1
|
Self-stabilization by counter ushing and window washing (M.S. thesis
– Costello
- 1996
|
|
1
|
Stabilizing observers
– Gouda
- 1994
|
|
1
|
T.Rodehe er, E.Sattenthwaite, and C.Thacker. Autonet: a high-speed, self-con guring local area network using point-to-point links
– Schroeder, Burrows, et al.
- 1990
|
|
1
|
Self-stabilization by local checking and correction (PhD thesis
– GVarghese
- 1993
|
|
1
|
Self-stabilization by counter ushing
– GVarghese
- 1994
|
|
1
|
Self-stabilization by counter ushing. "http://dworkin.wustl.edu/varghese/PAPERS
– Varghese
- 1998
|
|
1
|
Self-stabilization by counter flushing and window washing (M.S. thesis
– Costello
- 1996
|
|
1
|
Self-stabilization by counter flushing
– GVarghese
- 1994
|
|
1
|
Self-stabilization by counter flushing. "http://dworkin.wustl.edu/varghese/PAPERS
– Varghese
- 1998
|
|
