An exercise in fault-containment: Self-stabilizing leader election

DOI10.1016/0020-0190(96)00121-4zbMath0875.68473OpenAlexW2162250318MaRDI QIDQ671627

Arobinda Gupta, Sukumar Ghosh

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(96)00121-4

zbMATH Keywords

Distributed computingLeader electionFault-toleranceFault-containmentSelf-stabilization

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (13)

SELF-STABILIZING ANONYMOUS LEADER ELECTION IN A TREE ⋮ Fault-containing self-stabilization in asynchronous systems with constant fault-gap ⋮ An efficient fault-containing self-stabilizing algorithm for the shortest path problem ⋮ Parallel composition for time-to-fault adaptive stabilization ⋮ Fault-containing self-stabilizing distributed protocols ⋮ A self-stabilizing algorithm for the maximum flow problem ⋮ Fault containment in weakly stabilizing systems ⋮ Timer-based composition of fault-containing self-stabilizing protocols ⋮ Self-stabilizing Distributed Protocol Switching ⋮ ANALYSIS OF THE AVERAGE EXECUTION TIME FOR A SELF-STABILIZING LEADER ELECTION ALGORITHM ⋮ Computing fault-containment times of self-stabilizing algorithms using lumped Markov chains ⋮ Monotonic self-stabilization and its application to robust and adaptive pattern formation ⋮ Fault-containing self-stabilization using priority scheduling

Cites Work

• Unnamed Item
• Self-stabilizing systems in spite of distributed control
• Inconsistency and contamination (preliminary version)

This page was built for publication: An exercise in fault-containment: Self-stabilizing leader election