An Exercise in Fault-Containment: Self-Stabilizing Leader Election

@article{Ghosh1996AnEI,
  title={An Exercise in Fault-Containment: Self-Stabilizing Leader Election},
  author={Sukumar Ghosh and Arobinda Gupta},
  journal={Inf. Process. Lett.},
  year={1996},
  volume={59},
  pages={281-288}
}
Self-stabilizing algorithms are designed to guarantee convergence to some desired stable state from arbitrary initial states arising out of an arbitrarily large number of faults. However, in a well-designed system, the simultaneous occurrence of a large number of faults is rare. It is therefore desirable to design algorithms that are not only self-stabilizing, but also have the ability to recover very fast from a bounded number of faults. As an illustration, we present a simple self-stabilizing… CONTINUE READING
Highly Cited
This paper has 68 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 42 extracted citations

69 Citations

0510'97'02'08'14
Citations per Year
Semantic Scholar estimates that this publication has 69 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

Maxima finding in a ring

  • X. Lin, S. Ghosh
  • in: Proc. 28th Ann. Allerton Conf on Computers…
  • 1993

Similar Papers

Loading similar papers…