- Consensus algorithm
- Key-value engine
- Distributed transaction
- Remote Procedure Calls (RPC)
- Resource scheduling
- Distributed SQL over TiKV
Paxos is a protocol that Leslie Lamport and others have written extensively about. The most succinct paper describing Paxos is “Paxos Made Easy” published by Lamport in 2001. The original paper “The Part-Time Parliment” was published in 1989.
Paxos defines several roles, and each node in a cluster may perform in one or many roles. Each cluster has a single eventually chosen leader, and then some number of learners (which take action on the agreed upon request), Acceptors (which form quorums and act as “memory”), and proposers (which advocate for client requests and coordinate).
Unlike Raft, which represents a relatively concrete protocol, Paxos represents a family of protocols. Each variant has different tradeoffs.
A few variants of Paxos:
- Basic Paxos: The basic protocol, allowing consensus about a single value.
- Multi Paxos: Allow the protocol to handle a stream of messages with less overhead than Basic Paxos.
- Cheap Paxos: Reduce number of nodes needed via dynamic reconfiguration in exchange for reduced burst fault tolerance.
- Fast Paxos: Reduce the number of round trips in exchange for reduced fault tolerance.
- Byzantine Paxos: Withstanding Byzantine failure scenarios.
- Raft: Described in the next chapter.
It has been noted in the industry that Paxos is notoriously difficult to learn. Algorithms such as Raft are designed deliberately to be more easy to understand.
Due to complexities in the protocol, and the range of possibilities, it can be difficult to ascertain the state of a system when things go wrong (or are going right).
The basic Paxos algorithm itself does not define things like how to handle leader failures or membership changes.