By Topic

Hierarchical peer-to-peer overlay with cluster-reputation-based adaptation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chih-Lin Hu ; Department of Communication Engineering, National Central University, Taoyuan, Taiwan, R.O.C. ; Tzu-Han Kuo

This paper proposes a hierarchical cluster-based peer-to-peer overlay scheme based on both of partially-centralized and semi-structured overlay models in light of network locality and proximity. This joint design can keep up system efficacy and flexibility in dynamic networks where peer churn, peer mobility and search redundancy become stickier. In addition, a special reputation tree is exploited to mitigate the free-riding problem over a large-scale system. By simulation results, the proposed scheme can react to above issues without loss of prominent performance.

Published in:

2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing

Date of Conference:

23-26 Aug. 2009