1. Karger D, Lehman E, Leighton T, et al. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web [C]//Proc 29th Annual ACM Symposium on Theory of Computing, New York: ACM Press, 1997.
2. Naor M, Wieder U. Novel architectures for P2P applications: The continuous-discrete approach [J]//ACM Transactions on Algorithms, 2007, 3(3): 50–59.
3. Valerie K, Jared S. Choosing a random peer [C]//Proc 23rd ACM Symposium on Principles of Distributed Computing (PODC’04), New York: ACM Press, 2004: 125–130.
4. Nie Xiaowen, Lu Xianliang, LI Liang, et al. On the necessity of load balance in DHT [J]. Computer Science, 2009, 36(9): 92–95(Ch).
5. Wang Xiaoming, Dmitri L. Load-balancing performance of consistent hashing: asymptotic analysis of random node join [J]. IEEE/ACM Transactions on Networking, 2007, 15(4): 892–905.