Computing fault-containment times of self-stabilizing algorithms using lumped Markov chains

DOI10.3390/a11050058zbMath1461.68039OpenAlexW2801164407MaRDI QIDQ2283837

Volker Turau

Publication date: 13 January 2020

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a11050058

zbMATH Keywords

Markov chainfault-tolerancedistributed algorithmsself-stabilizationlumping

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (1)

Monotonic self-stabilization and its application to robust and adaptive pattern formation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fault-containing self-stabilizing \((3-\frac 2{\varDelta+1})\)-approximation algorithm for vertex cover in anonymous networks
• An exercise in fault-containment: Self-stabilizing leader election
• Scalable self-stabilization
• Simple distributed \(\Delta+1\)-coloring of graphs
• Fault-containing self-stabilization in asynchronous systems with constant fault-gap
• Coupling and self-stabilization
• Fault-containing self-stabilizing distributed protocols
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• Distributed Computing: A Locality-Sensitive Approach
• Distributed Graph Coloring: Fundamentals and Recent Developments
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Distributed error confinement

This page was built for publication: Computing fault-containment times of self-stabilizing algorithms using lumped Markov chains