BSU: a biased seed unchoking algorithm for p2p systems

  • Authors:
  • Xianglin Wei;Guomin Zhang;Jianhua Fan;Ming Chen

  • Affiliations:
  • Nanjing Telecommunication Technology Institute, Nanjing, China,Institute of Command Automation, PLA Univ. of Sci. & Tech., Nanjing, China;Institute of Command Automation, PLA Univ. of Sci. & Tech., Nanjing, China;Nanjing Telecommunication Technology Institute, Nanjing, China;Institute of Command Automation, PLA Univ. of Sci. & Tech., Nanjing, China

  • Venue:
  • IDCS'12 Proceedings of the 5th international conference on Internet and Distributed Computing Systems
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

As the source of the content in P2P systems, the main objective of the seed is to help deliver the content to all peers as soon as possible and to ensure the quality of service of the peers as well as to stimulate them to contribute resources to the system. Recent researches mostly concentrate on either the unchoking algorithms of the leechers or the scheduling algorithms of the seed.In contrast, the unchoking algorithms of the seeds have drawn little attention. Experimental results have shown that the unchoking algorithm of the seeds may have a remarkable impact on the performance of the system, especially when there are a large amount of free-riders in the system. Firstly, a P2P content delivery model based on the fluid model is established in this paper. Secondly, a biased seed unchoking algorithm (BSU) is put forward. Finally, a series of experiments in both homogeneous and heterogeneous environments are conducted to investigate the performance of BSU. Experimental results show that BSU may achieve better performance than existing algorithm used in BitTorrent-like systems remarkably.