• Corpus ID: 14689258

In Search of an Understandable Consensus Algorithm

@inproceedings{Ongaro2014InSO,
  title={In Search of an Understandable Consensus Algorithm},
  author={Diego Ongaro and John K. Ousterhout},
  booktitle={USENIX Annual Technical Conference},
  year={2014}
}
Raft is a consensus algorithm for managing a replicated log. [...] Key Method In order to enhance understandability, Raft separates the key elements of consensus, such as leader election, log replication, and safety, and it enforces a stronger degree of coherency to reduce the number of states that must be considered. Results from a user study demonstrate that Raft is easier for students to learn than Paxos. Raft also includes a new mechanism for changing the cluster membership, which uses overlapping…Expand
Raft Consensus Algorithm: an Effective Substitute for Paxos in High Throughput P2P-based Systems
One of the significant problem in peer-to-peer databases is collision problem. These databases do not rely on a central leader that is a reason to increase scalability and fault tolerance. Utilizing
Reducing the Energy Footprint of a Distributed Consensus Algorithm
TLDR
This work adjusts Raft quorums in a way that would allow updates to proceed with as few as two servers while requiring a larger quorum for electing a new leader, and replaces one or two of the five Raft servers with witnesses, lightweight servers that maintain the same metadata as other servers but hold no data and can therefore run on very low-power hosts.
Raft Refloated: Do We Have Consensus?
TLDR
This study developed a clean-slate implementation of the Raft protocol and built an event-driven simulation framework for prototyping it on experimental topologies and empirically validate the correctness of theRaft protocol invariants and evaluate Raft's understandability claims.
Paxos vs Raft: have we reached consensus on distributed consensus?
TLDR
This paper considers the question of which algorithm, Paxos or Raft, is the better solution to distributed consensus to determine exactly how they differ by describing a simplified Paxos algorithm using Raft's terminology and pragmatic abstractions.
In Search of a Scalable Raft-based Replication Architecture
TLDR
The Niagara replication architecture is presented, which makes it possible to build scalable systems while still relying on Raft for consensus, and shows how Niagara parallelizes the process of appending new log entries across multiple Raft instances.
Pirogue, a lighter dynamic version of the Raft distributed consensus algorithm
TLDR
A modified dynamic-linear voting protocol is presented that disables single-server updates and it is shown that a Raft cluster with four participants managed by this protocol would be almost as available as a conventional Raft Cluster with five participants and always tolerate the irrecoverable failure of any single participant without any data loss.
Lecture Notes on Leader-based Sequence Paxos - An Understandable Sequence Consensus Algorithm
TLDR
This work presents a complete and practical Paxos-based algorithm for reconfigurable sequence consensus in the fail-recovery model, and a clear path of simple step-by-step transformations to it from the basic Paxos algorithm.
ARC: Analysis of Raft Consensus
TLDR
This project implemented and evaluated a framework for constructing fault-tolerant applications, utilising the recently proposed Raft algorithm for distributed consensus, and proposed a range of optimisations to the protocol.
Ark: A Real-World Consensus Implementation
TLDR
Ark is an implementation of a consensus algorithm similar to Paxos and Raft, designed as an improvement over the existing consensus algorithm used by MongoDB and TokuMX to fix deficiencies in MongoDB's consensus algorithms.
Using TLA+ to Specify Leader Election of Raft Algorithm with Consideration of Leadership Transfer in Multiple Controllers
TLDR
The measured time of reelection and time of leadership transfer proves that the availability of the cluster is heightened when the Leader is asked to shut down, and therefore the Raft algorithm is increased to prevent the cluster unavailable.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 56 REFERENCES
How to Build a Highly Available System Using Consensus
TLDR
The general scheme for efficient highly available computing is explained, a general method for understanding concurrent and fault-tolerant programs is given, and the Paxos algorithm is derived as an example of the method.
There is more consensus in Egalitarian parliaments
TLDR
Egalitarian Paxos is to the authors' knowledge the first protocol to achieve the previously stated goals efficiently, requiring only a simple majority of replicas to be non-faulty, using a number of messages linear in the number of replica to choose a command, and committing commands after just one communication round.
Multicoordinated Paxos
TLDR
The Fast Paxos algorithm is extended and applied to Generalized Consensus, a generalization of agreement problems that can use the application semantics to avoid collisions and thus provide better availability and allowing load balance.
Generalized Consensus and Paxos
TLDR
Theoretician's Abstract Consensus is generalized to include both traditional consensus and this weaker version, and a straightforward generalization of the Paxos consensus algorithm implements general consensus.
Viewstamped Replication: A New Primary Copy Method to Support Highly-Available Distributed Systems
TLDR
This paper presents a new replication algorithm that has desirable performance properties, based on the primary copy technique, and uses a special kind of timestamp called a viewstamp to detect lost information.
Zab: High-performance broadcast for primary-backup systems
TLDR
Zab is a crash-recovery atomic broadcast algorithm designed for the ZooKeeper coordination service that guarantees that if it delivers a given state change, then all other changes it depends upon must be delivered first.
Paxos Made Practical
Paxos [3] is a simple protocol that a group of machines in a distributed system can use to agree on a value proposed by a member of the group. If it terminates, the protocol reaches consensus even if
The ABCD's of Paxos
TLDR
An abstract version of Lamport's Paxos algorithm for asynchronous consensus is described and the Byzantine, classic, and disk versions of Paxos are derived, showing how they are related to each other, and discussing the safety, liveness, and performance of each one.
Fast Paxos
  • L. Lamport
  • Computer Science
    Distributed Computing
  • 2006
TLDR
Fast Paxos is an extension of the classic Paxos algorithm that allows the value to be learned in two message delays, and a TLA+ specification of the algorithm appears as an appendix.
Leases: an efficient fault-tolerant mechanism for distributed file cache consistency
TLDR
An analytic model and an evaluation for file access in the V system show that leases of short duration provide good performance and the impact of leases on performance grows more significant in systems of larger scale and higher processor performance.
...
1
2
3
4
5
...