Two Blocks Are Enough: On the Feasibility of Using Network Coding to Ameliorate the Content Availability of BitTorrent Swarms
Issue No.08 - Aug. (2013 vol.24)
Qing-Chao Cai , The Hong Kong Polytechnic University, Hong Kong
Kwok-Tung Lo , The Hong Kong Polytechnic University, Hong Kong
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2012.211
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.
Encoding, Network coding, Availability, Vectors, Bandwidth, Peer to peer computing, Complexity theory, network coding, Encoding, Network coding, Availability, Vectors, Bandwidth, Peer to peer computing, Complexity theory, performance analysis, Peer-to-peer networks, BitTorrent
Qing-Chao Cai, Kwok-Tung Lo, "Two Blocks Are Enough: On the Feasibility of Using Network Coding to Ameliorate the Content Availability of BitTorrent Swarms", IEEE Transactions on Parallel & Distributed Systems, vol.24, no. 8, pp. 1682-1694, Aug. 2013, doi:10.1109/TPDS.2012.211