Self-stabilization by local checking and correction (extended abstract)

  • Authors:
  • Baruch Awerbuch;Boaz Patt-Shamir;George Varghese

  • Affiliations:
  • -;-;-

  • Venue:
  • SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
  • Year:
  • 1991

Quantified Score

Hi-index 0.00

Visualization

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.