By Topic

A study on the pieces on seed for mobile peer-to-peer file sharing applications

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

4 Author(s)
JiuJun Cheng ; State Key Lab. of Networking & Switching, Beijing Univ. of Posts & Telecommun., China ; XiaoPeng Lv ; KuiFei Yu ; Jian Ma

Piece selection is one of fundamental operations for mobile P2P file sharing applications, to some extent, it would affect the integrity of file what users obtain. Having investigated the feature of piece selection algorithm of BitTorrent carefully, a new piece selection algorithm based on seed control is presented in this paper. Comparing with the piece selection algorithm of BitTorrent, the proposed one(PSASC) requires seed to control the piece selection in order to avoid its repetition. The-set-covering problem and greedy approximation algorithm are utilized to analyze time complexities of piece selection algorithm of BitTorrent and PSASC, and the simulation is given. Results indicate that the time complexity of PSASC outperforms that of BitTorrent, and shorten the time that all pieces on seed are allocated into mobile P2P network. Finally, based on PSASC, the relation between the n pieces on seed and the mean time T~ that each piece has been downloaded is obtained by M/M/1/m/m queuing model.

Published in:

Proceedings. 2005 International Conference on Wireless Communications, Networking and Mobile Computing, 2005.  (Volume:2 )

Date of Conference:

23-26 Sept. 2005