A Study on The Pieces on Seed For Mobile Peer-to-Peer File Sharing Applications
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.
P2P BitTorrent the-set-covering problem greedy approximation algorithm M/M/1/m/m
JiuJun Cheng XiaoPeng Lv KuiFei Yu Jian Ma
State Key Laboratory Of Networking & Switching Beijing Univ.of Post & Telecom Beijing, China Nokia Research Center Beijing, China
国际会议
武汉
英文
829-833
2005-09-23（万方平台首次上网日期，不代表论文的发表时间）