This chapter covers why wall clocks can't be trusted in distributed systems, and how logical and vector clocks solve the ordering problem.

This chapter covers why distributed consensus is hard, how Paxos and Raft solve it, and how Raft's leader election works in practice.

This chapter covers 2PC, its failure modes, and how the Saga pattern enables reliable distributed workflows without a coordinator lock.

This chapter provides a deep analysis of single-leader, multi-leader, and leaderless replication with quorum reads and writes.

This chapter covers gossip protocols, phi accrual failure detection, and how Cassandra uses gossip to maintain cluster membership without a central coordinator.

This chapter explains consistent hashing rings, virtual nodes, and why this algorithm is the default for distributed caching and sharding.