2000 character limit reached
Multi-probe consistent hashing (1505.00062v1)
Published 1 May 2015 in cs.DS
Abstract: We describe a consistent hashing algorithm which performs multiple lookups per key in a hash table of nodes. It requires no additional storage beyond the hash table, and achieves a peak-to-average load ratio of 1 + epsilon with just 1 + 1/epsilon lookups per key.