Recent results on fault-tolerant consensus in message-passing networks
From MaRDI portal
Publication:2835019
Abstract: Fault-tolerant consensus has been studied extensively in the literature, because it is one of the most important distributed primitives and has wide applications in practice. This paper surveys important results on fault-tolerant consensus in message-passing networks, and the focus is on results from the past decade. Particularly, we categorize the results into two groups: new problem formulations and practical applications. In the first part, we discuss new ways to define the consensus problem, which includes larger input domains, link fault models, different network models . . . etc, and briefly discuss the important techniques. In the second part, we focus on Crash Fault-Tolerant (CFT) systems that use Paxos or Raft, and Byzantine Fault-Tolerant (BFT) systems. We also discuss Bitcoin, which can be related to solving Byzantine consensus in anonymous systems, and compare Bitcoin with BFT systems and Byzantine consensus.
Recommendations
Cites work
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- Asynchronous convex hull consensus in the presence of crash faults
- Bounded cost algorithms for multivalued consensus using binary consensus instances
- Byzantine vector consensus in complete graphs
- Communication optimal multi-valued asynchronous Byzantine agreement with optimal resilience
- Communication optimal multi-valued asynchronous broadcast protocol
- Concurrent programming: algorithms, principles, and foundations.
- Consensus in networked multi-agent systems with adversaries
- Distributed consensus revisited
- Easy impossibility proofs for distributed consensus problems
- Error-free multi-valued consensus with Byzantine failures
- Fast Paxos
- Fault-tolerant consensus in directed graphs
- From binary consensus to multivalued consensus in asynchronous message-passing systems
- Impossibility of distributed consensus with one faulty process
- Impossibility results for distributed computing
- Iterative approximate Byzantine consensus in arbitrary directed graphs
- Low complexity resilient consensus in networked multi-agent systems with adversaries
- Minimal synchrony for Byzantine consensus
- More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
- Multidimensional approximate agreement in Byzantine asynchronous systems
- On k -set consensus problems in asynchronous systems
- Optimally efficient multi-valued byzantine agreement
- Partial synchrony based on set timeliness
- Principles of Distributed Systems
- Reaching Agreement in the Presence of Faults
- Reaching approximate Byzantine consensus with multi-hop communication
- Reaching approximate agreement in the presence of faults
- Recent results on fault-tolerant consensus in message-passing networks
- Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^{2})\) messages, and constant time
- The Bitcoin Backbone Protocol: Analysis and Applications
- The Byzantine Generals Problem
- The Byzantine generals strike again
Cited in
(8)- A Byzantine fault tolerant hybrid consensus mechanism applicable to consortium blockchain
- Message-optimal protocols for fault-tolerant broadcasts/multicasts in distributed systems with crash failures
- Recent results on fault-tolerant consensus in message-passing networks
- SoK: a consensus taxonomy in the blockchain era
- Stellar consensus by instantiation
- A network-failure-tolerant message-passing system for terascale clusters
- A fault-tolerant message passing algorithm and its hardware implementation
- Fast agreement in networks with Byzantine nodes
This page was built for publication: Recent results on fault-tolerant consensus in message-passing networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835019)
