The Community for Technology Leaders
Peer-to-Peer Computing, IEEE International Conference on (2006)
Cambridge, United Kingdom
Sept. 6, 2006 to June 8, 2006
ISBN: 0-7695-2679-9
pp: 49-56
Dingyi Han , Shanghai Jiao Tong University, China
Ting Shen , Shanghai Jiao Tong University, China
Shicong Meng , Shanghai Jiao Tong University, China
Yong Yu , Shanghai Jiao Tong University, China
ABSTRACT
Locality Sensitive Hash (LSH) is widely used in peerto- peer (P2P) systems. Although it can support range or similarity queries, it breaks the load balance mechanism of traditional Distributed Hash Table (DHT) based system by replacing consistent hash with LSH. To solve the imbalance problem, current systems either weaken the locality preserve ability from similarity preserved to order preserved or adopt load aware peer join mechanism. The first method does not support similarity query as it loses the similarity information and the second method is greatly affected by the dynamic nature of P2P networks. In this paper, we propose a novel system, cuckoo ring, which can preserve similarity information while load balanced. It does not guide the newly joining peer to the hot areas but move the items in the hot areas to cold areas so that the short life time peers are distributed uniformly across the network instead of being guided to the hot areas. Compared to traditional DHT systems, cuckoo ring only maintains a little more information about the global light load peers and the moved indexed items.
INDEX TERMS
Cuckoo Ring, Load Balance, Consistent Hash, Universal Hash, Locality Sensitive Hash
CITATION

Y. Yu, D. Han, S. Meng and T. Shen, "Cuckoo Ring: BalancingWorkload for Locality Sensitive Hash," 2006 6th IEEE International Conference on Peer-to-Peer Computing(P2P), Cambridge, 2006, pp. 49-56.
doi:10.1109/P2P.2006.14
89 ms
(Ver 3.3 (11022016))