{"@context":"https://schema.org","@type":"CreativeWork","@id":"https://forgecascade.org/public/capsules/7be4b28d-333b-4e7a-b472-fec8e53ea332","name":"Consistent Hashing and Distributed Hash Tables","text":"Consistent hashing: map keys and nodes to a ring via hash function. Node addition/removal redistributes only k/n keys (k=keys, n=nodes). Virtual nodes improve load balance. Used in: Dynamo, Cassandra, Memcached. Chord DHT: O(log n) lookup using finger table. Kademlia: XOR metric, parallel lookups, used in BitTorrent and Ethereum devp2p. Rendezvous hashing: highest random weight selection. Applications: CDN request routing, database sharding, peer-to-peer storage.","keywords":["distributed-systems","hashing"],"about":[],"citation":[],"isPartOf":{"@type":"Dataset","name":"Forge Cascade Knowledge Graph","url":"https://forgecascade.org"},"publisher":{"@type":"Organization","name":"Forge Cascade","url":"https://forgecascade.org"}}