Optimizing the BitTorrent performance using an adaptive peer selection strategy

BitTorrent employs a static quota-based peer selection strategy to fixedly allocate upload quotas for the Tit-For-Tat (TFT) choke algorithm and Optimistic Unchoke (OU) algorithm. This static quota allocation scheme would incur a paradox of supply and demand between upload peers and request peers. The paradox of supply and demand means that many request peers stay in the starvation state while many upload quotas stay in the idleness state. We propose a dynamic quota-based peer selection strategy, where request peers are classified by the principle of investment return and each upload peer adaptively allocates upload quotas for the TFT and OU algorithms according to dynamically changed numbers of different request peers. Simulation experiments show that our dynamic quota allocation scheme can eliminate the paradox of supply and demand, increase the resource utility ratio of upload peers, and decrease the file download time, at the cost of uploading more a few file blocks for each upload peer.

[1]  Rob Sherwood,et al.  Slurpie: a cooperative bulk data transfer protocol , 2004, IEEE INFOCOM 2004.

[2]  Sandjai Bhulai,et al.  A Multiphased Approach for Modeling and Analysis of the BitTorrent Protocol , 2007, 27th International Conference on Distributed Computing Systems (ICDCS '07).

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

[4]  Rayadurgam Srikant,et al.  Modeling and performance analysis of BitTorrent-like peer-to-peer networks , 2004, SIGCOMM 2004.

[5]  Laurent Massoulié,et al.  Coupon replication systems , 2005, IEEE/ACM Transactions on Networking.

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

[7]  Johan A. Pouwelse,et al.  The Bittorrent P2P File-Sharing System: Measurements and Analysis , 2005, IPTPS.

[8]  Christos H. Papadimitriou,et al.  Free-riding and whitewashing in peer-to-peer systems , 2006, IEEE J. Sel. Areas Commun..

[9]  Christos Gkantsidis,et al.  Network coding for large scale content distribution , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[10]  Gustavo de Veciana,et al.  Service capacity of peer to peer networks , 2004, IEEE INFOCOM 2004.

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

[12]  William Chan,et al.  Improving Traffic Locality in BitTorrent via Biased Neighbor Selection , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[13]  Miguel Castro,et al.  SplitStream: high-bandwidth multicast in cooperative environments , 2003, SOSP '03.

[14]  Guillaume Urvoy-Keller,et al.  Rarest first and choke algorithms are enough , 2006, IMC '06.

[15]  Xiaoning Ding,et al.  Measurements, analysis, and modeling of BitTorrent-like systems , 2005, IMC '05.

[16]  Venkata N. Padmanabhan,et al.  Analyzing and Improving a BitTorrent Networks Performance Mechanisms , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[17]  Gilles Fedak,et al.  Towards efficient data distribution on computational desktop grids with BitTorrent , 2007, Future Gener. Comput. Syst..

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

[19]  Mikel Izal,et al.  Dissecting BitTorrent: Five Months in a Torrent's Lifetime , 2004, PAM.

[20]  Kam-Wing Ng,et al.  Modeling, Analysis and Improvement for BitTorrent-Like File Sharing Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[21]  Amin Vahdat,et al.  Bullet: high bandwidth data dissemination using an overlay mesh , 2003, SOSP '03.

[22]  Amin Vahdat,et al.  Maintaining High-Bandwidth Under Dynamic Network Conditions , 2005, USENIX Annual Technical Conference, General Track.

[23]  Arun Venkataramani,et al.  Do Incentives Build Robustness in BitTorrent? (Awarded Best Student Paper) , 2007, NSDI.