Self-stabilizing leader election in polynomial steps

DOI10.1016/J.IC.2016.09.002zbMath1370.68026OpenAlexW2506785934MaRDI QIDQ528197

Alain Cournier, Karine Altisen, Stéphane Devismes, Franck Petit, Anaïs Durand

Publication date: 12 May 2017

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://hal.sorbonne-universite.fr/hal-01347471/file/main.pdf

zbMATH Keywords

fault-tolerancedistributed algorithmsself-stabilizationleader electionunfair daemon

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (5)

A silent self-stabilizing algorithm for the generalized minimal \(k\)-dominating set problem ⋮ Self-stabilizing silent disjunction in an anonymous network ⋮ The first fully polynomial stabilizing algorithm for BFS tree construction ⋮ Optimized silent self-stabilizing scheme for tree-based constructions ⋮ Near-optimal knowledge-free resilient leader election

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An \(O(n)\)-time self-stabilizing leader election algorithm
• Self-stabilizing leader election in optimal space under an arbitrary scheduler
• Memory requirements for silent stabilization
• Distributed network protocols
• Time Optimal Asynchronous Self-stabilizing Spanning Tree
• Self-stabilizing systems in spite of distributed control
• Distributed reset
• Time optimal self-stabilizing synchronization

This page was built for publication: Self-stabilizing leader election in polynomial steps