5. Other considerations
•
Given a resource key and a list of servers, how do you find a
primary, second, tertiary (and on down the line) server for the
resource?
•
If you have different size servers, how do you assign each of them
an amount of work that corresponds to their capacity?
•
How do you smoothly add capacity to the system without
downtime? Specifically, this means solving two problems:
•
How do you avoid dumping 1/N of the total load on a new
server as soon as you turn it on?
•
How do you avoid rehashing more existing keys than
necessary?
11. •
Consistent Hashing and Random Trees: Distributed
Caching Protocols for Relieving Hot Spots on the
World Wide Web
http://thor.cs.ucsb.edu/~ravenben/papers/coreos/kll+97.pdf
•
http://www.tomkleinpeter.com/2008/03/17/
programmers-toolbox-part-3-consistent-hashing/
•
https://weblogs.java.net/blog/tomwhite/archive/
2007/11/consistent_hash.html