Two blocks are enough: On the feasibility of using network coding to ameliorate the content availability of BitTorrent swarms

Qing Chao Cai, Kwok Tung Lo

Research output: Journal article publicationJournal articleAcademic researchpeer-review

2 Citations (Scopus)

Abstract

In this paper, we conduct an in-depth study on the feasibility of using network coding to ameliorate the content availability of BitTorrent swarms. We first perform mathematical analysis on the potential improvement in the content availability and bandwidth utilization induced by two existing network coding schemes. It is found that these two coding schemes either incur a very high coding complexity and disk operation overhead or cannot effectively leverage the potential of improving the content availability. In this regard, we propose a simple sparse network coding scheme in which both the drawbacks mentioned before are precluded. To accommodate the proposed coding scheme into BitTorrent, a new block scheduling algorithm is also developed based on the original rarest-first block scheduling policy of BitTorrent. Through extensive simulations and performance evaluations, we show that the proposed coding scheme is very effective in terms of improving the content availability of BitTorrent swarms when compared with some existing methods.
Original languageEnglish
Article number6235956
Pages (from-to)1682-1694
Number of pages13
JournalIEEE Transactions on Parallel and Distributed Systems
Volume24
Issue number8
DOIs
Publication statusPublished - 17 Jul 2013

Keywords

  • BitTorrent
  • network coding
  • Peer-to-peer networks
  • performance analysis

ASJC Scopus subject areas

  • Signal Processing
  • Hardware and Architecture
  • Computational Theory and Mathematics

Cite this