Understanding Raft Consensus
summary
Explains how the Raft consensus algorithm works in theory, using live diagrams to illustrate leader election, log replication, and safety rules. Also presents real-world use cases where Raft is applied (e.g., distributed coordination in systems that need fault-tolerant replication).
AI-written summary · about
chapters (17)
- 0:00Raft introduction
- 1:06What is Raft
- 4:40Raft core problems
- 6:24Leader election
- 11:21Candidate voting
- 15:51Timeouts and integrity
- 17:59Normal operation
- 20:07Log replication
- 23:20Inconsistent leaders
- 26:04Raft simulation demo
- 26:24Code example
- 29:13Node implementation
- 31:23Heartbeat and timers
- 32:30Append entries
- 35:11RPC and gRPC
- 36:14Client consistency
- 39:14Q&A
related talks
41mThe Raft Consensus Algorithm
01h 32mHow to Reach Consensus with Paper, Pencil and the Raft Algorithm
01h 27mHow to Reach Consensus Using Paper, Pencil and the Raft Algorithm
47mDistributed Systems: When Democracy and Computer Science Come Together
44mImproving Raft Survivability in Real-World Conditions
14mDistributed Consensus in 15 Minutes!
01h 13mPaxos vs Raft: Have we reached consensus on distributed consensus?
44mCluster Consensus: When Aeron Met Raft