Self-stabilization by local checking and correction
- 9 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 268-277
- https://doi.org/10.1109/sfcs.1991.185378
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
This publication has 12 references indexed in Scilit:
- Self-stabilization of the alternating-bit protocolPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Bootstrap network resynchronization (extended abstract)Published by Association for Computing Machinery (ACM) ,1991
- Memory-efficient self stabilizing protocols for general networksPublished by Springer Nature ,1991
- Efficient dispersal of information for security, load balancing, and fault toleranceJournal of the ACM, 1989
- On the effects of feedback in dynamic network protocolsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Applying static network protocols to dynamic networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Distributed snapshotsACM Transactions on Computer Systems, 1985
- Resynch Procedures and a Fail-Safe Network ProtocolIEEE Transactions on Communications, 1979
- Self-stabilizing systems in spite of distributed controlCommunications of the ACM, 1974
- A note on reliable full-duplex transmission over half-duplex linksCommunications of the ACM, 1969