Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications

Why this one

Read this after Consistent Hashing and Random Trees. That paper gives you the ring as a load-balancing trick. Chord asks the next systems question: if no machine has the whole map, how does a request find the right owner without flooding the network or trusting a central directory? The answer is a tiny routing table with exponentially spaced shortcuts, plus a stabilization protocol that repairs the map as nodes join and leave. People often remember Chord as old peer-to-peer history, but the useful idea is broader: partitioning is only half a design, lookup maintenance is the other half. If you are building sharded storage, service discovery, distributed caches, or any system where ownership moves, this paper gives you a clean mental model for routing, churn, and the cost of decentralization.