Self-stabilizing leader election in dynamic networks

DOI10.1007/s00224-017-9758-9zbMath1392.68097OpenAlexW2605050564MaRDI QIDQ722199

Lawrence L. Larmore, Ajoy K. Datta

Publication date: 23 July 2018

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-017-9758-9

zbMATH Keywords

ditheringself-stabilizationleader electionincumbencyunfair daemonsilent algorithm

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items

Self-stabilizing systems in spite of high dynamics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A leader election algorithm for dynamic networks with causal clocks
• An \(O(n)\)-time self-stabilizing leader election algorithm
• Self-stabilizing leader election in optimal space under an arbitrary scheduler
• The local detection paradigm and its applications to self-stabilization
• A jamming-resistant MAC protocol for single-hop wireless networks
• Self-stabilizing systems in spite of distributed control
• Time, clocks, and the ordering of events in a distributed system
• Distributed reset
• Optimal elections in faulty loop networks and applications
• Design and analysis of dynamic leader election protocols in broadcast networks
• Time optimal self-stabilizing synchronization