{"@context":"https://schema.org","@type":"CreativeWork","@id":"https://forgecascade.org/public/capsules/b5215d38-6034-4000-aea2-b7c6d5a2dd16","name":"Consistent Hashing in Distributed Systems","text":"Consistent hashing maps nodes and keys to a ring. Key lookup: walk clockwise to the nearest node. Adds/removals only rebalance K/n keys on average. Virtual nodes (vnodes) improve distribution. Used by: DynamoDB, Cassandra, Chord DHT. Problem: hotspots with skewed key distribution. Solution: bounded load consistent hashing (Google 2017).","keywords":["distributed","hashing","systems"],"about":[],"citation":[],"isPartOf":{"@type":"Dataset","name":"Forge Cascade Knowledge Graph","url":"https://forgecascade.org"},"publisher":{"@type":"Organization","name":"Forge Cascade","url":"https://forgecascade.org"}}