This project is read-only.
Consistent hashing is a special kind of hashing. In contrast, in most traditional hash tables, a change in the number of array slots causes nearly all keys to be remapped. By using consistent hashing, only keys need to be remapped on average, where is the number of keys, and is the number of slots. Consistent hashing could play an increasingly important role as internet use increases and as distributed systems grow more prevalent.

Consistence Hash Usage
Data Destitution across Multiple Server Nodes
Consistent hash becomes more powerful when you add and/or remove server to your distributed node space. In the old load balance way almost all objects will hashed into a new location every time you add and remove a server. This will require all objects to be rehashed . Consistent hashing can guarantee that when a server is removed, only the objects stored in it will be rehashed; when a new server is added, only a fairly few objects will be rehashed.

Last edited May 19, 2012 at 2:28 AM by debruyee, version 2


No comments yet.