Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures

DOI10.1016/J.JCSS.2019.06.003MaRDI QIDQ2009633zbMATH OpenOpenAlexWikidataFDO

Authors Ernesto Jiménez, José Luis López-Presa, Javier Martín-Rueda

Publication date 29 November 2019

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcss.2019.06.003

zbMATH Keywords

Byzantine failuresconsensusdistributed algorithmsomega failure detectorunknown membership

Mathematics Subject Classification ID

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

Recommendations

• Byzantine Fault Detectors for Solving Consensus
• Consensus in Byzantine asynchronous systems
• Anonymous asynchronous systems: the case of failure detectors
• Anonymous asynchronous systems: the case of failure detectors
• Unreliable failure detectors for reliable distributed systems

Cites work

• Asynchronous byzantine agreement protocols
• Asynchronous consensus and broadcast protocols
• Consensus in the presence of mortal Byzantine faulty processes
• Distributed agreement in the presence of processor and communication faults
• scientific article; zbMATH DE number 4058844 (Why is no real title available?)
• scientific article; zbMATH DE number 3784244 (Why is no real title available?)
• scientific article; zbMATH DE number 2006647 (Why is no real title available?)
• Implementing unreliable failure detectors with unknown membership
• Impossibility of distributed consensus with one faulty process
• On implementing omega in systems with weak reliability and synchrony assumptions
• On the minimal synchronism needed for distributed consensus
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• The weakest failure detector for solving consensus
• Time, clocks, and the ordering of events in a distributed system
• Unreliable failure detectors for reliable distributed systems
• Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies (extended abstract)

Cited in

(2)

• Communication-efficient and crash-quiescent omega with unknown membership
• On implementing omega with weak reliability and synchrony assumptions

This page was built for publication: Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures

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