Self-stabilizing leader election in polynomial steps

DOI10.1016/J.IC.2016.09.002MaRDI QIDQ528197zbMATHOpenAlexFDO

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

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

distributed algorithmsfault-toleranceleader electionself-stabilizationunfair daemon

Mathematics Subject Classification ID

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

Recommendations

• Self-stabilizing leader election in optimal space under an arbitrary scheduler
• An \(O(n)\)-time self-stabilizing leader election algorithm
• Self-stabilizing leader election in dynamic networks
• Self-stabilizing weak leader election in anonymous trees using constant memory per edge
• SELF-STABILIZING ANONYMOUS LEADER ELECTION IN A TREE

Cites work

• scientific article; zbMATH DE number 1332668 (Why is no real title available?)
• scientific article; zbMATH DE number 1332672 (Why is no real title available?)
• scientific article; zbMATH DE number 2061549 (Why is no real title available?)
• An \(O(n)\)-time self-stabilizing leader election algorithm
• Distributed network protocols
• Distributed reset
• Memory requirements for silent stabilization
• Self-stabilization
• Self-stabilizing leader election in optimal space under an arbitrary scheduler
• Self-stabilizing systems in spite of distributed control
• Time Optimal Asynchronous Self-stabilizing Spanning Tree
• Time optimal self-stabilizing synchronization

Cited in

(19)

• scientific article; zbMATH DE number 7561458 (Why is no real title available?)
• A silent self-stabilizing algorithm for the generalized minimal \(k\)-dominating set problem
• Self-stabilizing leader election in optimal space under an arbitrary scheduler
• Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative
• ANALYSIS OF THE AVERAGE EXECUTION TIME FOR A SELF-STABILIZING LEADER ELECTION ALGORITHM
• The first fully polynomial stabilizing algorithm for BFS tree construction
• scientific article; zbMATH DE number 2006655 (Why is no real title available?)
• Communication efficient self-stabilizing leader election
• A note on leader election in directed split-stars and directed alternating group graphs
• Compact self-stabilizing leader election for general networks
• SELF-STABILIZING ANONYMOUS LEADER ELECTION IN A TREE
• Self-stabilizing leader election in dynamic networks
• Optimized silent self-stabilizing scheme for tree-based constructions
• An \(O(n)\)-time self-stabilizing leader election algorithm
• Self-stabilizing weak leader election in anonymous trees using constant memory per edge
• Near-optimal knowledge-free resilient leader election
• Self-stabilizing silent disjunction in an anonymous network
• scientific article; zbMATH DE number 2006647 (Why is no real title available?)
• Self-stabilizing systems in spite of high dynamics

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q528197)