The Community for Technology Leaders
RSS Icon
Issue No.12 - Dec. (2013 vol.24)
pp: 2526-2537
Jiaqing Luo , The Hong Kong Polytechnic University, Hong Kong
Bin Xiao , The Hong Kong Polytechnic University, Hong Kong
Kai Bu , The Hong Kong Polytechnic University, Hong Kong
Shijie Zhou , University of Electronic Science and Technology of China, Chengdu
Piece-related algorithms, including piece revelation, selection, and queuing, play a crucial role in the BitTorrent (BT) protocol, because the BT system can be viewed as a market where peers trade their pieces with one another. During the piece exchanging, a peer selects some pieces revealed by neighbors, and queues them up for downloading. In this paper, we provide a deep understanding of these algorithms, and also propose some improvements to them. Previous study has shown that the piece revelation strategy is vulnerable to under-reporting. We provide a game-theoretic analysis for this selfish gaming, and propose a distributed credit method to prevent it. Existing piece selection strategies, though long believed to be good enough, may fail to balance piece supply and demand. We propose a unified strategy to shorten the download time of peers by applying utility theory. The design of the piece queuing algorithm has a conflict with that of piece selection strategy, because it is not possible to assume that the queued requests for a selected piece can always be available on multiple neighbors. We give a possible fix to address the conflict by allowing peers to dynamically manage their unfulfilled requests. To evaluate the performance of the proposed algorithms, we run several experiments in a live swarm. Our primary results show that they can achieve fast individual and system-wide download time.
Protocols, Heuristic algorithms, Games, Algorithm design and analysis, Peer to peer computing, Supply and demand, Degradation,peer-to-peer, BitTorrent, piece-related algorithms
Jiaqing Luo, Bin Xiao, Kai Bu, Shijie Zhou, "Understanding and Improving Piece-Related Algorithms in the BitTorrent Protocol", IEEE Transactions on Parallel & Distributed Systems, vol.24, no. 12, pp. 2526-2537, Dec. 2013, doi:10.1109/TPDS.2013.8
[1] B. Cohen, "The Bittorrent Protocol Specification," , 2013.
[2] H. Schulze and K. Mochalski, "Internet Study 2008/2009," mediafiles/ documentsinternet-study-2008-2009.pdf , 2009.
[3] D. Levin, K. Lacurts, N. Spring, and B. Bhattacharjee, "Bittorrent is an Auction: Analyzing and Improving Bittorrent's Incentives," Proc. ACM SIGCOMM '08, pp. 243-254, 2008.
[4] L. Fjeldsted, J. Fonseca, and B. Reza, "Specification and Implementation of the Bittorrent Protocol," technical report, 2005.
[5] TheoryOrg, "Bittorrent Protocol Specification v 1.0," technical report, TheoryOrg.
[6] P. Gray, Psychology, sixth ed. Worth Publishers, 2010.
[7] "Fudenberg and Tirole," Game Theory, MIT Press, 1992.
[8] B. Cohen, "The Bittorrent Protocol Specification," technical report,, 2008.
[9] A. Legout, G. Urvoy-Keller, and P. Michiardi, "Rarest First and Choke Algorithms Are Enough," Proc. Sixth ACM SIGCOMM on Internet Measurement (IMC '06), pp. 203-216, 2006.
[10] R.C. Merton, Continuous-Time Finance. Blackwell, 1990.
[11] X. Yang and G. de Veciana, "Service Capacity in Peer-to-Peer Networks," Proc. IEEE INFOCOM '04, pp. 2242-2252, Mar. 2004.
[12] L. Guo, S. Chen, Z. Xiao, E. Tan, X. Ding, and X. Zhang, "Measurements, Analysis, and Modeling of Bittorrent-Like Systems," Proc. Fifth ACM SIGCOMM Conf. Internet Measurement (IMC '05), 2005.
[13] R.R. Daniel Stutzbach, "Understanding Churn in Peer-to-Peer Networks," Proc. Sixth ACM SIGCOMM Conf. Internet Measurement (IMC '06), pp. 189-202, 2006.
[14] J. Luo, "The Java Bt Client," index.html, 2013.
[15] BitComet, "A Free C++ Bittorrent/http/ftp Download Client," , 2013.
52 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool