Self-Organizing Content Distribution in a Data Indexed DHT Network

Authors:
Chen Wang;Bassam A. Alqaralleh;Bing Bing Zhou;Fabian Brites;Albert Y. Zomaya
Affiliations:
University of Sydney, Australia;University of Sydney, Australia;University of Sydney, Australia;University of Sydney, Australia;University of Sydney, Australia
Venue:
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
Year:
2006

Citing 0
Cited 2

A flabellate overlay network for multi-attribute search

Journal of Parallel and Distributed Computing
A proactive method for content distribution in a data indexed DHT overlay

HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications

Quantified Score

Hi-index	0.01

Visualization

Abstract

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. 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.