Consistent hashing is a special kind of hashing such that when a hash table is resized and consistent hashing is used, only K/n keys need to be remapped on average, where K is the number of keys, and n is the number of slots. Consitent hashing is often used in distributed hash tables
Reference: http://michaelnielsen.org/blog/consistent-hashing/