Issue No. 12 - December (2011 vol. 22)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2011.94
F. Albanese , EURECOM, Sophia Antipolis, France
P. Michiardi , EURECOM, Sophia Antipolis, France
G. Neglia , INRIA, Sophia Antipolis, France
D. Carra , Dept. of Comput. Sci., Univ. of Verona, Verona, Italy
The success of BitTorrent has fostered the development of variants to its basic components. Some of the variants adopt greedy approaches aiming at exploiting the intrinsic altruism of the original version of BitTorrent in order to maximize the benefit of participating to a torrent. In this work, we study BitTyrant, a recently proposed strategic client. BitTyrant tries to determine the exact amount of contribution necessary to maximize its download rate by dynamically adapting and shaping the upload rate allocated to its neighbors. We evaluate in detail the various mechanisms used by BitTyrant to identify their contribution to the performance of the client. Our findings indicate that the performance gain is due to the increased number of connections established by a BitTyrant client, rather than to its subtle uplink allocation algorithm; surprisingly, BitTyrant reveals to be altruistic and particularly efficient in disseminating the content, especially during the initial phase of the distribution process. The possible gain of a single BitTyrant client, however, disappears in the case of a widespread adoption: our results indicate a severe loss of efficiency that we analyze in detail.
peer-to-peer computing, uplink allocation algorithm, BitTorrent swarms, greedy peers, BitTyrant, Peer to peer computing, Bandwidth, Performance evaluation, Analytical models, Resource management, Capacity planning, performance analysis., Peer-to-peer, BitTorrent
F. Albanese, P. Michiardi, G. Neglia and D. Carra, "On the Robustness of BitTorrent Swarms to Greedy Peers," in IEEE Transactions on Parallel & Distributed Systems, vol. 22, no. , pp. 2071-2078, 2011.