Team Incentives in BitTorrent Systems

Although the popular BitTorrent protocol strives to limit free-riding via its tit-for-tat incentives, recent research efforts have shown that it does not strictly enforce fairness. Freeriding opportunities indeed exist, mainly via optimistic unchokes, a BitTorrent mechanism that facilitates the continuous discovery of better peers to interact with. Our results in this work also show that increasing numbers of free-riders can considerably hurt the performance of compliant peers. In an effort to address this problem, this paper proposes a new BitTorrent-like protocol that dynamically organizes peers of similar upload bandwidth in teams— groups of peers collaborating for mutual benefit. Team members mostly satisfy their data download needs inside their team and only perform optimistic unchokes when absolutely necessary. As a result, this team-based protocol improves peer performance via explicit cooperation. At the same time, it limits bandwidth spent on optimistic unchokes, thereby rendering the system more robust against free-riders. We have modified an existing BitTorrent implementation to implement the team protocol and have evaluated its impact by running real experiments on a controlled PlanetLab testbed. Our results show that the protocol enables slightly improved performance for compliant peers, while free-riders are unable to sustain high download rates, as compared to regular BitTorrent. In addition, we observe a higher degree of robustness: increasing numbers of free-riders in the system have a significantly lower negative impact on the performance of contributing peers.

[1]  B. Cohen,et al.  Incentives Build Robustness in Bit-Torrent , 2003 .

[2]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[3]  Bin Fan,et al.  The Delicate Tradeoffs in BitTorrent-like File Sharing Protocol Design , 2006, Proceedings of the 2006 IEEE International Conference on Network Protocols.

[4]  Alexandru Iosup,et al.  2Fast : Collaborative Downloads in P2P Networks , 2006, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06).

[5]  Vishal Misra,et al.  Improving BitTorrent: a simple approach , 2008, IPTPS.

[6]  Eddie Kohler,et al.  Clustering and sharing incentives in BitTorrent systems , 2006, SIGMETRICS '07.

[7]  Mustaque Ahamad,et al.  Incentives in BitTorrent induce free riding , 2005, P2PECON '05.

[8]  Michael Sirivianos,et al.  Free-riding in BitTorrent Networks with the Large View Exploit , 2007, IPTPS.

[9]  Vinod M. Prabhakaran,et al.  On the Role of Helpers in Peer-to-Peer File Download Systems: Design, Analysis and Simulation , 2007, IPTPS.

[10]  Laurent Massoulié,et al.  Faithfulness in internet algorithms , 2004, PINS '04.

[11]  David E. Culler,et al.  Operating Systems Support for Planetary-Scale Network Services , 2004, NSDI.

[12]  J. Tukey,et al.  Variations of Box Plots , 1978 .

[13]  Joseph Hao,et al.  Enhancing Collaborative Content Delivery with Helpers , 2004 .

[14]  Arun Venkataramani,et al.  Do incentives build robustness in bit torrent , 2007 .

[15]  Stefan Schmid,et al.  Rescuing Tit-for-Tat with Source Coding , 2007, Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007).

[16]  Jiangchuan Liu,et al.  A Measurement Study of Piece Population in BitTorrent , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[17]  Eddie Kohler,et al.  Exploiting BitTorrent For Fun , 2006, IPTPS.

[18]  R. Srikant,et al.  Modeling and performance analysis of BitTorrent-like peer-to-peer networks , 2004, SIGCOMM '04.

[19]  Stefan Schmid,et al.  Free Riding in BitTorrent is Cheap , 2006, HotNets.