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

被引：0
|
作者：
Cheng, JJ [1 ]
Lv, XP [1 ]
Yu, KF [1 ]
Jian, M [1 ]
机构：
[1] Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching, Beijing 100088, Peoples R China
来源：
2005 INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING PROCEEDINGS, VOLS 1 AND 2 | 2005年
关键词：
P2P; BitTorrent; the-set-covering problem; greedy approximation algorithm; M/M/1/m/m;
D O I：
暂无
中图分类号：
TN [电子技术、通信技术];
学科分类号：
0809 ;
摘要：
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) over bar that each piece has been downloaded is obtained by M/M/1/m/m queuing model.
引用
收藏
页码：829 / 833
页数：5
相关论文
共 50 条
  • [21] Modeling file popularity in peer-to-peer file sharing systems
    Bolla, Raffaele
    Eickhoff, Mirko
    Pawlikowski, Krys
    Sciuto, Michele
    ASMTA 2007: PROCEEDINGS OF THE 14TH INTERNATIONAL CONFERENCE ON ANALYTICAL AND STOCHASTIC MODELLING TECHNIQUES AND APPLICATIONS, 2007, : 149 - 155
  • [22] A chord-based novel mobile peer-to-peer file sharing protocol
    Li, M
    Chen, EH
    Sheu, PC
    FRONTIERS OF WWW RESEARCH AND DEVELOPMENT - APWEB 2006, PROCEEDINGS, 2006, 3841 : 806 - 811
  • [23] Peer-to-peer file-sharing over mobile ad hoc networks
    Ding, G
    Bhargava, B
    SECOND IEEE ANNUAL CONFERENCE ON PERVASIVE COMPUTING AND COMMUNICATIONS WORKSHOPS, PROCEEDINGS, 2004, : 104 - 108
  • [24] Simulative performance evaluation of a mobile peer-to-peer file-sharing system
    Hossfeld, T
    Tutschku, K
    Andersen, FU
    de Meer, H
    Oberender, JO
    2005 NEXT GENERATION INTERNET NETWORKS, 2005, : 281 - 287
  • [25] Fair Peer Assignment Scheme for Peer-to-Peer File Sharing
    Hu, Chih-Lin
    Chen, Da-You
    Chang, Yi-Hsun
    Chen, Yu-Wen
    KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, 2010, 4 (05): : 709 - 735
  • [26] Peer-to-peer applications beyond file sharing: overlay network requirements and solutions
    Darlagiannis, V.
    Heckmann, O.
    Steinmetz, R.
    ELEKTROTECHNIK UND INFORMATIONSTECHNIK, 2006, 123 (06): : 242 - 250
  • [27] Forensic investigation of peer-to-peer file sharing networks
    Liberatore, Marc
    Erdely, Robert
    Kerle, Thomas
    Levine, Brian Neil
    Shields, Clay
    DIGITAL INVESTIGATION, 2010, 7 : S95 - S103
  • [28] Bandwidth allocation in peer-to-peer file sharing networks
    Creus-Mir, Albert
    Casadesus-Masanell, Ramon
    Hervas-Drane, Andres
    COMPUTER COMMUNICATIONS, 2008, 31 (02) : 257 - 265
  • [29] Applying Network Coding to Peer-to-Peer File Sharing
    Yang, Min
    Yang, Yuanyuan
    IEEE TRANSACTIONS ON COMPUTERS, 2014, 63 (08) : 1938 - 1950
  • [30] Optimal strategies for efficient peer-to-peer file sharing
    Mehyar, Mortada
    Gu, WeiHsin
    Low, Steven H.
    Effros, Michelle
    Ho, Tracey
    2007 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOL IV, PTS 1-3, 2007, : 1337 - +
12345