Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links

DOI10.1007/S004460050016MaRDI QIDQ5137014zbMATH OpenOpenAlexFDO

Authors Hasan Md. Sayeed, Marwan abu-Amara, Hosame Abu-Amara

Publication date 30 November 2020

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s004460050016

zbMATH Keywords

distributed algorithmsByzantine agreementfault-tolerant computingasynchronous networksfaulty channels

Mathematics Subject Classification ID

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

Recommendations

• Election in asynchronous complete networks with intermittent link failures
• Fast asynchronous Byzantine agreement and leader election with full information
• Principles of Distributed Systems
• On Optimal Probabilistic Asynchronous Byzantine Agreement
• Fault tolerant distributed majority commitment

Cites work

• A locking protocol for resource coordination in distributed databases
• Easy impossibility proofs for distributed consensus problems
• Electing a leader in a ring with link failures
• Electing a leader in a synchronous ring
• Election in asynchronous complete networks with intermittent link failures
• Fault tolerant distributed majority commitment
• Fault-tolerant distributed algorithm for election in complete networks
• Impossibility of distributed consensus with one faulty process
• Modular construction of a Byzantine agreement protocol with optimal message bit complexity
• On the minimal synchronism needed for distributed consensus
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• The Byzantine generals strike again
• Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks

Cited in

(7)

• Communication-efficient leader election and consensus with limited link synchrony
• Fault tolerant distributed majority commitment
• Election in asynchronous complete networks with intermittent link failures
• Synchronous consensus under hybrid process and link failures
• scientific article; zbMATH DE number 4096766 (Why is no real title available?)
• Fast asynchronous Byzantine agreement and leader election with full information
• Making asynchronous distributed computations robust to noise

This page was built for publication: Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links

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