Fault-tolerant distributed algorithm for election in complete networks

DOI10.1109/12.2189zbMath0709.94511OpenAlexW2122315613MaRDI QIDQ3495068

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)

Related Items (7)

Reliable synchronization in distributed systems ⋮ Distributed computing in asynchronous networks with byzantine edges ⋮ Initial failures in distributed computations ⋮ 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 ⋮ Nogood-based asynchronous forward checking algorithms ⋮ Leader Election in Sparse Dynamic Networks with Churn

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