The Community for Technology Leaders
RSS Icon
Issue No.08 - Aug. (2013 vol.24)
pp: 1682-1694
Qing-Chao Cai , The Hong Kong Polytechnic University, Hong Kong
Kwok-Tung Lo , The Hong Kong Polytechnic University, Hong Kong
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
[1] G. De Veciana and X. Yang, "Fairness, Incentives and Performance in Peer-to-Peer Networks," Proc. 41st Ann. Allerton Conf. Comm., Control and Computing, pp. 150-164, 2003.
[2] D. Qiu and R. Srikant, "Modeling and Performance Analysis of Bittorrent-Like Peer-to-Peer Networks," Proc. ACM SIGCOMM, pp. 367-378, 2004.
[3] B. Fan, D.-M. Chiu, and J.C.S. Lui, "Stochastic Analysis and File Availability Enhancement for BT-like File Sharing Systems," Proc. 14th IEEE Int'l Workshop Quality of Service, pp. 30-39, 2006.
[4] L. Massoulie and M. Vojnovic, "Coupon Replication Systems," IEEE/ACM Trans. Networking, vol. 16, no. 3, pp. 603-616, June 2008.
[5] A. Legout, G. Urvoy-Keller, and P. Michiardi, "Rarest First and Choke Algorithms Are Enough," Proc. Sixth ACM SIGCOMM, pp. 203-216, 2006.
[6] S. Jun and M. Ahamad, "Incentives in Bittorrent Induce Free Riding," Proc. ACM SIGCOMM, pp. 116-121, 2005.
[7] M. Piatek, T. Isdal, T. Anderson, A. Krishnamurthy, and A. Venkataramani, "Do Incentives Build Robustness in Bittorrent?" Proc. Fourth USENIX Symp. Networked Systems Design & Implementation (NSDI), pp. 1-14, 2007.
[8] D. Levin, K. LaCurts, N. Spring, and B. Bhattacharjee, "Bittorrent Is An Auction: Analyzing and Improving Bittorrent's Incentives," Proc. ACM SIGCOMM, pp. 243-254, 2008.
[9] L. Guo, S. Chen, Z. Xiao, E. Tan, X. Ding, and X. Zhang, "A Performance Study of Bittorrent-Like Peer-to-Peer Systems," IEEE J. Selected Areas in Comm., vol. 25, no. 1, pp. 155-169, Jan. 2007.
[10] J.A. Pouwelse, P. Garbacki, D.H.J. Epema, and H.J. Sips, "The Bittorrent P2p File-Sharing System: Measurements and Analysis," Proc. Fourth Int'l Workshop Peer-to-Peer Systems (IPTPS), 2005.
[11] D.S. Menasche, A.A.A. Rocha, B. Li, D. Towsley, and A. Venkataramani, "Content Availability and Bundling in Swarming Systems," Proc. Fifth Int'l Conf. Emerging Networking Experiments and Technologies, pp. 121-132, 2009.
[12] Q.-C. Cai and K.-T. Lo, "Modeling and Analysis of Content Availability and Bundling in Bittorrent-Like File Swarming Systems," Under Submission,
[13] R. Ahlswede, N. Cai, S.Y.R. Li, and R.W. Yeung, "Network Information Flow," IEEE Trans. Information Theory, vol. 46, no. 4, pp. 1204-1216, July 2000.
[14] C. Gkantsidis and P.R. Rodriguez, "Network Coding for Large Scale Content Distribution," Proc. 24th IEEE INFOCOM, pp. 2235-2245, 2005.
[15] M. Wang and B. Li, "${R}^2$ : Random Push with Random Network Coding in Live Peer-to-Peer Streaming," IEEE J. Selected Areas in Comm., vol. 25, no. 9, pp. 1655-1666, Dec. 2007.
[16] C. Ortolf, C. Schindelhauer, and A. Vater, "Paircoding: Improving File Sharing Using Sparse Network Codes," Proc. Fourth Int'l Conf. Internet and Web Applications and Services, pp. 49-57, 2009.
[17] D. Carra, G. Neglia, P. Michiardi, and F. Albanese, "On the Robustness of Bittorrent Swarms to Greedy Peers," IEEE Trans. Parallel and Distributed Systems, vol. 22, no. 12, pp. 2071-2078, Dec. 2011.
[18] C.-J. Wu, C.-Y. Li, and J.-M. Ho, "Improving the Download Time of Bittorrent-Like Systems," Proc. IEEE Int'l Conf. Comm. (ICC), pp. 1125-1129, June 2007.
[19] K. Huang, L. Wang, D. Zhang, and Y. Liu, "Optimizing the Bittorrent Performance Using an Adaptive Peer Selection Strategy," Future Generation Computer Systems, vol. 24, no. 7, pp. 621-630, July 2008.
[20] R. Bindal, P. Cao, W. Chan, J. Medved, G. Suwala, T. Bates, and A. Zhang, "Improving Traffic Locality in Bittorrent via Biased Neighbor Selection," Proc. 26th IEEE Int'l Conf. Distributed Computing Systems, pp. 66-75, 2006.
[21] D.R. Choffnes and F.E. Bustamante, "Taming the Torrent: A Practical Approach to Reducing Cross-ISP Traffic in Peer-to-Peer Systems," Proc. ACM SIGCOMM, pp. 363-374, 2008.
[22] R. Cuevas, N. Laoutaris, X. Yang, G. Siganos, and P. Rodriguez, "Deep Diving into Bittorrent Locality," Proc. ACM SIGMETRICS Int'l Conf. Measurement and Modeling of Computer Systems, pp. 349-350, 2010.
[23] S. Le Blond, A. Legout, and W. Dabbous, "Pushing Bittorrent Locality to the Limit," Computer Networks, vol. 55, no. 3, pp. 541-557, Feb. 2011.
[24] B. Liu, Y. Cui, Y. Lu, and Y. Xue, "Locality-Awareness in Bittorrent-Like p2p Applications," IEEE Trans. Multimedia, vol. 11, no. 3, pp. 361-371, Apr. 2009.
[25] S. Ren, E. Tan, T. Luo, S. Chen, L. Guo, and X. Zhang, "Topbt: A Topology-Aware and Infrastructure-Independent Bittorrent Client," Proc. 29th IEEE INFOCOM '10, pp. 1523-1531, 2010.
[26] J.S. Otto, M.A. Sánchez, D.R. Choffnes, F.E. Bustamante, and G. Siganos, "On Blind Mice and the Elephant: Understanding the Network Impact of a Large Distributed System," Proc. ACM SIGCOMM, pp. 110-121, 2011.
[27] A.R. Bharambe, C. Herley, and V.N. Padmanabhan, "Analyzing and Improving a Bittorrent Networks Performance Mechanisms," Proc. 25th IEEE INFOCOM, pp. 1-12, Apr. 2006.
[28] F. Liu, S. Shen, B. Li, B. Li, H. Yin, and S. Li, "Novasky: Cinematic-Quality VOD in a p2p Storage Cloud," Proc. IEEE INFOCOM, Apr. 2011.
[29] P. Chou, Y. Wu, and K. Jain, "Practical Network Coding," Proc. Allerton Conf. Comm., Control, and Computing, 2003.
[30] J. Kamal, L. Laszlo, and C. Philip, "Building Scalable and Robust Peer-to-Peer Overlay Networks for Broadcasting Using Network Coding," Distributed Computing, vol. 19, no. 4, pp. 301-311, Mar. 2007.
[31] Z. Liu, C. Wu, B. Li, and S. Zhao, "UUSee: Large-Scale Operational On-Demand Streaming with Random Network Coding," Proc. IEEE INFOCOM, pp. 1-9, Mar. 2010.
[32] F. Liu, Y. Sun, B. Li, and B. Li, "Quota: Rationing Server Resources in Peer-Assisted Online Hosting Systems," Proc. IEEE Int'l Conf. Network Protocols, pp. 103-112, Oct. 2009.
[33] Y. Sun, F. Liu, B. Li, B. Li, and X. Zhang, "Fs2you: Peer-Assisted Semi-Persistent Online Storage at a Large Scale," Proc. IEEE INFOCOM, pp. 873-881, Apr. 2009.
41 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool