• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Lei Yingchun, Yang Litang, Jiang Qi, Gong Yili, Zhang Jun. Measurement and Analysis of BitTorrent[J]. Journal of Computer Research and Development, 2008, 45(9): 1589-1600.
Citation: Lei Yingchun, Yang Litang, Jiang Qi, Gong Yili, Zhang Jun. Measurement and Analysis of BitTorrent[J]. Journal of Computer Research and Development, 2008, 45(9): 1589-1600.

Measurement and Analysis of BitTorrent

More Information
  • Published Date: September 14, 2008
  • The P2P content distribution, represented by BitTorrent, has become a popular P2P application. In BitTorrent, peers employ neighbor selection mechanism, choking/unchoking mechanism, and piece selection algorithm to get the required file rapidly. BitTorrent brings the users good downloading experience. However, it is strongly controversial in application. Most complaints come from the ISPs. BitTorrent is not highly efficient. Its fast downloading experience is at cost of network abuse. And this kind of misuse badly affects other Internet services supported by ISPs. An in-depth analysis from the perspective of techniques is demanded to understand the reasons why BitTorrent is popular with users and content providers, while complained by ISPs. Only if all the advantages and the disadvantages of BitTorrent are figured out, it is possible to design a better P2P content distribution protocol. From the perspective of performance, the behaviors of BitTorrent are measured, its key elements are explained, and its efficiency is analyzed. The results are as follows: 1) An effective way to measure the performance of P2P content distribution systems is proposed; 2) It is confirmed that BitTorrents key mechanisms, such as neighbor selection mechanism, choking/unchoking mechanism, and piece selection algorithm, is not highly efficient; and 3) A ShareStorm protocol is designed, which overcomes those flaws of BitTorrent. Preliminary experiment shows that in terms of download time, ShareStorm outperforms BitTorrent by 50%.
  • Related Articles

    [1]Liu Biao, Zhang Fangjiao, Wang Wenxin, Xie Kang, Zhang Jianyi. A Byzantine-Robust Federated Learning Algorithm Based on Matrix Mapping[J]. Journal of Computer Research and Development, 2021, 58(11): 2416-2429. DOI: 10.7544/issn1000-1239.2021.20210633
    [2]Zhang Dakun, Song Guozhi, Lin Huazhou, Ren Shuxia. Double Improved Genetic Algorithm and Low Power Task Mapping in 3D Networks-on-Chip[J]. Journal of Computer Research and Development, 2016, 53(4): 921-931. DOI: 10.7544/issn1000-1239.2016.20150682
    [3]Zhang Fengbin and Wang Tianbo. Real Value Negative Selection Algorithm with the n-Dimensional Chaotic Map[J]. Journal of Computer Research and Development, 2013, 50(7): 1387-1398.
    [4]Zhao Long, Han Wenbao, and Yang Hongzhi. Research on ECC Attacking Algorithm Based on SIMD Instructions[J]. Journal of Computer Research and Development, 2012, 49(7): 1553-1559.
    [5]Xiao Chuangbai, Yu Jing, Xue Yi. A Novel Fast Algorithm for MAP Super-Resolution Image Reconstruction[J]. Journal of Computer Research and Development, 2009, 46(5): 872-880.
    [6]Mu Fei, Xue Wei, Shu Jiwu, and Zheng Weimin. A Mapping Algorithm for Replicated Data in LargeScale Storage System[J]. Journal of Computer Research and Development, 2009, 46(3): 492-497.
    [7]Chen Jing, Jiang Junjie, Duncan S. Wong, Deng Xiaotie, Wang Dongsheng. High Performance Architecture for Elliptic Curve Scalar Multiplication Based on FPGA[J]. Journal of Computer Research and Development, 2008, 45(11): 1947-1954.
    [8]Wang Baojin, Li Mingshu. A Priority Mapping Algorithm Without Affecting the Schedulability of Tasks Set[J]. Journal of Computer Research and Development, 2006, 43(6): 1083-1089.
    [9]Wang Baojin, Li Mingshu, Wang Zhigang. The Priority Mapping Problem in Static Real-Time Middleware[J]. Journal of Computer Research and Development, 2006, 43(4): 722-728.
    [10]Zhang Han, Wang Xiufeng, Li Zhaohui, and Liu Dahai. A Fast Image Encryption Algorithm Based on Chaos System and Henon Map[J]. Journal of Computer Research and Development, 2005, 42(12): 2137-2142.

Catalog

    Article views (722) PDF downloads (494) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return