Why architecture matters here
Consistent hashing is elegant but not maintenance-free. Naive rings produce uneven distribution — some nodes get 30% of keys, others 5%. Adding a node triggers migration; if not throttled, it saturates the network. Removing a node without gossip agreement causes double reads or lost writes.
The architecture matters because virtual nodes solve distribution, bounded loads prevent hotspots, cluster management provides consistent membership, and the client library caches topology for fast routing.
Understanding the pieces lets you scale linearly and rebalance safely.
The architecture: every piece explained
The top strip is the core algorithm. Key hashes to a point on the Hash ring. Nodes own arcs of the ring; the key is assigned to the next node clockwise. Virtual nodes — each physical node registers many random points — smooth distribution and reduce jitter on membership changes.
The middle row is the extensions. Replica walk assigns the next K distinct nodes clockwise for replication. Add / remove node reassigns only the arcs of the affected node's neighbors. Bounded loads caps how much any one node owns; overflow spills to the next node. Variants — Anchor, Jump, Rendezvous (highest random weight) — each optimize for different properties (memory, evenness, minimal disruption).
The lower rows are management. Cluster manager handles membership via gossip or a coordination service. Client library caches the topology and refreshes on version bumps. Ops covers rebalance windows, hotspot mitigation, and drift detection when clients see stale topology.
End-to-end flow
End-to-end: a Cassandra cluster uses vnodes with 256 tokens per node. A key hashes to a point; ring lookup finds the owner; replica walk finds the next 2 replicas for RF=3. Query routes to the coordinator, then to the owners. A new node joins; gossip propagates; each existing node hands over its share of arcs. Migration is throttled to preserve throughput. Client libraries observe the topology change and refresh caches. Bounded load prevents any single node from being overwhelmed; the cluster stays balanced during the rebalance.