Fault-tolerant distributed algorithm for election in complete networks

DOI10.1109/12.2189MaRDI QIDQ3495068zbMATH OpenOpenAlexFDO

Authors Hosame Abu-Amara

Publication date 1988

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.2189

Mathematics Subject Classification ID

Information and communication theory, circuits (94-XX)

Cited in

(7)

• Reliable synchronization in distributed systems
• Nogood-based asynchronous forward checking algorithms
• Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links
• Design and analysis of dynamic leader election protocols in broadcast networks
• Leader election in sparse dynamic networks with churn
• Distributed computing in asynchronous networks with byzantine edges
• Initial failures in distributed computations

This page was built for publication: Fault-tolerant distributed algorithm for election in complete networks

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