Abstract
A distributed algorithm is self-stabilizing if starting from any state, it eventually reaches an allowed (legal) state. A self-stabilizing system running self-stabilizing algorithms recovers from faults and, once recovered, stays recovered. Self-stabilizing algorithms typically run in background and never stop. In this chapter, we review basic self-stabilization concepts and analyze BFS and DFS self-stabilizing algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Afek Y, Bremler A (1998) Self-stabilizing unidirectional network algorithms by power supply. Chic J Theor Comput Sci 1998:3
Afek Y, Kutten S, Yung M (1991) Memory efficient self-stabilizing protocols for general networks. In: Proc 4th international workshop on distributed algorithms, pp 15–28
Antonoiu G, Pradip K, Srimani PK (1995) A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph. Comput Math Appl 30:1–7
Arora A, Gouda MG (1992) Closure and convergence: a foundation for fault-tolerant computing. In: Proc 22nd international conference on fault-tolerant computing systems
Burns JE, Gouda MG, Miller RE (1989) On relaxing interleaving assumptions. In: Proc MCC workshop on self-stabilizing systems
Collin Z, Dolev S (1994) Self-stabilizing depth first search. Inf Process Lett 49:297–301
Dijkstra EW (1974) Self stabilizing systems in spite of distributed control. Commun ACM 17(11):643–644
Dolev S, Israeli A, Moran S (1993) Self-stabilization of dynamic systems assuming only read/write atomicity. Distrib Comput 7:3–16
Gartner FC (2003) A survey of self-stabilizing spanning-tree construction algorithms. EPFL technical report
Herman T (1991) Adaptivity through distributed convergence. PhD thesis, Department of Computer Science, University of Texas at Austin
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag London
About this chapter
Cite this chapter
Erciyes, K. (2013). Self-Stabilization. In: Distributed Graph Algorithms for Computer Networks. Computer Communications and Networks. Springer, London. https://doi.org/10.1007/978-1-4471-5173-9_8
Download citation
DOI: https://doi.org/10.1007/978-1-4471-5173-9_8
Publisher Name: Springer, London
Print ISBN: 978-1-4471-5172-2
Online ISBN: 978-1-4471-5173-9
eBook Packages: Computer ScienceComputer Science (R0)