Skip to main content
SpringerLink
Log in

A Framework of Safe Stabilization

  • Conference paper
  • First Online:
Self-Stabilizing Systems (SSS 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2704))

Included in the following conference series:

Abstract

Classical stabilizing systems do not take into consideration safety issues. This paper examines two different safety models for stabilizing distributed systems, and studies the cost of enforcing safety requirements in the context of various kinds of failures.

This research was supported in part by the National Science Foundation under grant CCR-9901391.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alpern B. and Schneider F.B. “Recognizing Safety and Liveness,” Distributed Computing 2(3), pp. 117–126, 1987. 129

    Article  MATH  Google Scholar 

  2. Anagnostou E. and Hadzilacos, V. “Tolerating Transient and Permanent Failures,” Workshop on Distributed Algorithms (WDAG), pp. 174–188, 1993. 136

    Google Scholar 

  3. Brown, G.M., Gouda, M.G. and Wu, C. L. “Token Systems that Self-stabilize,” IEEE Transactions on Computers 38(6) 1989. 134

    Google Scholar 

  4. Chandra, T., and Toueg, S. “Unreliable failure Detectors for Reliable Distributed Systems,” Journal of the ACM, pp. 374–382, April 1996. 139

    Google Scholar 

  5. Cournier A., Datta A.K., Petit F. and Villain V. “Snap-Stabilizing PIF Algorithm in Arbitrary Networks,” ICDCS 2002: 199–208. 129

    Google Scholar 

  6. Dijkstra, E.W. “Self-stabilizing Systems In Spite of Distributed Control,” Communications of the ACM 17, pp. 643–644, Nov 1974. 134

    Article  MATH  Google Scholar 

  7. Diestel, R. “Graph Theory,” Second Edition, Springer 2000. 136

    Google Scholar 

  8. Dolev, S. and Herman, T. “Superstabilizing Protocols for Dynamic Distributed Systems,” Chicago Journal of Theoretical Computer Science, 3(4), 1997. 129

    Google Scholar 

  9. Ghosh, S. and Gupta, A., “An Exercise in Fault-containment: Leader Election on a Ring,” Information Processing Letters 59, pp. 281–288, 1996. 129

    Article  MATH  MathSciNet  Google Scholar 

  10. Ghosh, S., Gupta, A., Herman T., and Pemmaraju, S.V. “Fault-containing Self-stabilizing Algorithms,” Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing, pp. 45–54, 1996. 129, 135, 139

    Google Scholar 

  11. Ghosh, S. and He, X. “Scalable Self-stabilization,” J. Parallel and Distributed Computing 62(5), pp. 945–960, 2002. 129, 136, 137, 139

    Article  MATH  Google Scholar 

  12. Ghosh, S. and Pemmaraju, S.V. “Trade-offs in Fault-Containing Self-Stabilization,” Proceedings of 3rd Workshop on Self-stabilizing Systems (Editors: Ghosh & Herman, Carleton University Press), pp. 157–169, Santa Barbara, August 1997. 134

    Google Scholar 

  13. Kiniwa J. “Avoiding Faulty Privileges in Self-Stabilizing Depth-First Token Passing,” ICPADS 2001: 390–397. 129

    Google Scholar 

  14. Kutten, S. and Peleg, D. “Universal Fault-local Mending,” Proceedings of the 14th ACM Symposium on Principles of Distributed Computing, pp. 20–29, 1995. 129

    Google Scholar 

  15. Kutten, S. and Patt-Shamir, B. “Time-adaptive Self-stabilization,” Proceedings of the 16th ACM Symposium on Principles of Distributed Computing, pp. 149–158, 1997. 137

    Google Scholar 

  16. Lamport L. Shoshtak, R. and Pease, M. “Byzantine Generals Problem,” ACM Transactions on Programming Languages and Systems 4(3) pp. 382–401, July 1982. 136

    Article  MATH  Google Scholar 

  17. Yen, I.-L. “A Highly Safe Self-stabilizing Mutual Exclusion Algorithm”. Information Processing Letters (57), pp.301–305, 1996. 129

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Iowa, Iowa City, IA, 52242, USA

    Sukumar Ghosh & Alina Bejan

Authors
  1. Sukumar Ghosh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alina Bejan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. College of Electrical Engineering and Computer Science, National Central University, Chung-Li, 32054, Taiwan

    Shing-Tsaan Huang

  2. Dept. of Computer Science, University of Iowa, Iowa City, IA, 52242, USA

    Ted Herman

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ghosh, S., Bejan, A. (2003). A Framework of Safe Stabilization. In: Huang, ST., Herman, T. (eds) Self-Stabilizing Systems. SSS 2003. Lecture Notes in Computer Science, vol 2704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45032-7_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-45032-7_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40453-8

  • Online ISBN: 978-3-540-45032-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation