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

DOI10.1007/S004460050016zbMATH Open1448.68158OpenAlexW2015556975MaRDI QIDQ5137014FDOQ5137014

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

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

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)

Cites Work

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

Cited In (8)

• Election in asynchronous complete networks with intermittent link failures
• Making asynchronous distributed computations robust to noise
• Title not available (Why is that?)
• Fault tolerant distributed majority commitment
• Communication-efficient leader election and consensus with limited link synchrony
• Synchronous consensus under hybrid process and link failures
• Fast asynchronous Byzantine agreement and leader election with full information
• Distributed computations in fully-defective networks

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)