12 citations · 12 across the 1 of their papers we have counts for
1 paper
Ben Appleton, Michael O'Reilly
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…