Title :
A study on the pieces on seed for mobile peer-to-peer file sharing applications
Author :
Cheng, Jiujun ; Lv, Xiaopeng ; Yu, Kuifei ; Ma, Jian
Author_Institution :
State Key Lab. of Networking & Switching, Beijing Univ. of Posts & Telecommun., China
Abstract :
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.
Keywords :
greedy algorithms; mobile computing; peer-to-peer computing; queueing theory; BitTorrent; M/M/1/m/m; approximation algorithm; mobile peer-to-peer file sharing applications; piece selection; queuing model; seed control; the-set-covering problem; time complexities; Algorithm design and analysis; Analytical models; Approximation algorithms; Bandwidth; Counting circuits; Laboratories; Mobile computing; Peer to peer computing; Radio frequency; Telecommunication switching;
Conference_Titel :
Wireless Communications, Networking and Mobile Computing, 2005. Proceedings. 2005 International Conference on
Print_ISBN :
0-7803-9335-X
DOI :
10.1109/WCNM.2005.1544180
