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: 241-248
Chen Wang , University of Sydney, Australia
Bassam A. Alqaralleh , University of Sydney, Australia
Bing Bing Zhou , University of Sydney, Australia
Fabian Brites , University of Sydney, Australia
Albert Y. Zomaya , University of Sydney, Australia
The paper discusses the access-skew problem in a data indexed DHT network. The difference in popularity of data indexes is likely to create access hotspots that overwhelm the host node. The capability of relieving heavily loaded nodes is essential to the scalability of an overlay network. <p>In this paper, we propose an effective content distribution method to relieve hotspots in a selforganizing manner. An algorithm is given to reduce the query traveling distance and balance the load among replica nodes. Moreover, we give a small-world model based algorithm to reduce the load-balancing cost. Experiment results show that the mechanism significantly reduces the number of dropped queries and the average query delay while keeping loadbalancing cost under control.</p>

B. B. Zhou, F. Brites, B. A. Alqaralleh, C. Wang and A. Y. Zomaya, "Self-Organizing Content Distribution in a Data Indexed DHT Network," 2006 6th IEEE International Conference on Peer-to-Peer Computing(P2P), Cambridge, 2006, pp. 241-248.
93 ms
(Ver 3.3 (11022016))