|描述：||197 pages : illustrations ; 23 cm|
|内容：||1. Introduction --
2. Definitions, Techniques, and Paradigms. 2.1. Definitions of the Computational Model. 2.2. Self-Stabilization Requirements. 2.3. Complexity Measures. 2.4. Randomized Self-Stabilization. 2.5. Example: Spanning-Tree Construction. 2.6. Example: Mutual Exclusion. 2.7. Fair Composition of Self-Stabilizing Algorithms. 2.8. Recomputation of Floating Output. 2.9. Proof Techniques. 2.10. Pseudo-Self-Stabilization --
3. Motivating Self-Stabilization. 3.1. Initialization of a Data-Link Algorithm in the Presence of Faults. 3.2. Arbitrary Configuration Because of Crashes. 3.3. Frequently Asked Questions --
4. Self-Stabilizing Algorithms for Model Conversions. 4.1. Token-Passing: Converting a Central Daemon to read/write.
"Self-stabilization, an important concept to theoreticians and practitioners in distributed computing and communication networks, refers to a system's abiiity to recover automatically from unexpected faults. Shlomi Dolev presents the fundamentals of self-stabilization and demonstrates the process of designing self-stabilizing distributed systems. He details the algorithms that can be started in an arbitrary state, allowing the system to recover from the faults that brought it to that state. The book proceeds from the basic concept of self-stabilzing algorithms to advanced applications."--Jacket.