By Topic

An Optimal Basis For Efficient Peer-To-Peer Content Distribution Algorithms

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
$31 $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)
Kangasharju, J. ; Helsinki Inst. for Inf. Technol., Helsinki ; Kangasharju, J.

Peer-to-peer content distribution has become extremely popular, thanks to its highly scalable performance. In this paper, we derive a lower bound on the performance of chunk-based peer-to-peer content distribution systems and develop an algorithm that is within 1 round of the lower bound in special cases, and within 1 + log2 2 (I) rounds in the general case, where I is the number of peers. We consider the performance of our algorithm also in a heterogeneous bandwidth environment and under churn. We show that our algorithm always achieves good performance and does not impose an undue burden on fast peers, thus providing a natural incentive for all peers to participate.

Published in:

Computer Communications and Networks, 2006. ICCCN 2006. Proceedings.15th International Conference on

Date of Conference:

9-11 Oct. 2006