loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06)
Self-Organizing Content Distribution in a Data Indexed DHT Network
Cambridge, United Kingdom
September 06-June 08
ISBN: 0-7695-2679-9
ASCII Text
x 
 
Chen Wang, Bassam A. Alqaralleh, Bing Bing Zhou, Fabian Brites, Albert Y. Zomaya, "Self-Organizing Content Distribution in a Data Indexed DHT Network," Peer-to-Peer Computing, IEEE International Conference on, pp. 241-248, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/P2P.2006.36,
author = {Chen Wang and Bassam A. Alqaralleh and Bing Bing Zhou and Fabian Brites and Albert Y. Zomaya},
title = {Self-Organizing Content Distribution in a Data Indexed DHT Network},
journal ={Peer-to-Peer Computing, IEEE International Conference on},
volume = {0},
year = {2006},
isbn = {0-7695-2679-9},
pages = {241-248},
doi = {http://doi.ieeecomputersociety.org/10.1109/P2P.2006.36},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Peer-to-Peer Computing, IEEE International Conference on
TI - Self-Organizing Content Distribution in a Data Indexed DHT Network
SN - 0-7695-2679-9
SP241
EP248
A1 - Chen Wang,
A1 - Bassam A. Alqaralleh,
A1 - Bing Bing Zhou,
A1 - Fabian Brites,
A1 - Albert Y. Zomaya,
PY - 2006
KW - null
VL - 0
JA - Peer-to-Peer Computing, IEEE International Conference on
ER -
 
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.

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.

Citation:
Chen Wang, Bassam A. Alqaralleh, Bing Bing Zhou, Fabian Brites, Albert Y. Zomaya, "Self-Organizing Content Distribution in a Data Indexed DHT Network," p2p, pp.241-248, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.