Paper Info
Title
Two Blocks Are Enough: On the Feasibility of Using Network Coding to Ameliorate the Content Availability of BitTorrent Swarms
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.
Year
DOI
Venue
2013
10.1109/TPDS.2012.211
IEEE Trans. Parallel Distrib. Syst.
Keywords
Field
DocType
coding scheme,existing method,simple sparse network,content availability,new block scheduling algorithm,bittorrent swarms,bittorrent swarm,proposed coding scheme,existing network,original rarest-first block scheduling,high coding complexity,encoding,vectors,availability,bittorrent,bandwidth,scheduling,mathematical analysis,network coding
Linear network coding,Computer science,Scheduling (computing),Computer network,Coding (social sciences),Bandwidth (signal processing),BitTorrent,Block scheduling,Bandwidth utilization,Distributed computing,Encoding (memory)
Journal
Volume
Issue
ISSN
24
8
1045-9219
Citations 
PageRank 
References 
1
0.35
16
Authors
2
Name
Order
Citations
PageRank
Qing-Chao Cai110.35
Kwok-Tung Lo266266.15