Distributed Consensus Protocols (Raft & Replicated State Machines)
How a cluster of unreliable servers agrees on one ordered sequence of events, using leader election and a replicated log.
Architecture diagrams, real-world examples, trade-offs, and interview questions for each concept.
How a cluster of unreliable servers agrees on one ordered sequence of events, using leader election and a replicated log.
How to generate unique, roughly time-sortable IDs across many servers without a central database.
When to use a queue that deletes messages after delivery, and when to use a replayable, partitioned event log.
What a distributed data store must give up during a network partition, and what it trades off the rest of the time.
Add or remove servers while moving only a small fraction of keys, instead of reshuffling almost everything.
Split one logical dataset across many databases when a single primary can no longer keep up with storage or write volume.
Scale reads and survive failures by copying data to replicas and routing queries by type.
How in-memory caches speed up reads, the main read/write patterns, and how to keep a cache consistent with the source of truth.
How load balancers spread traffic across servers, and when to route at the transport layer versus the application layer.