Nikolaos Laoutaris
Damiano Carra
ABSTRACT
Motivated by emerging cooperative P2P applications we study new uplink allocation algorithms for substituting the rate-based choke/unchoke algorithm of BitTorrent which was developed for non-cooperative environments. Our goal is to shorten the download times by improving the uplink utilization of nodes. We develop a new family of uplink allocation algorithms which we call BitMax, to stress the fact that they allocate to each unchoked node the maximum rate it can sustain, instead of an 1/(k + 1) equal share as done in the existing BitTorrent. BitMax computes in each interval the number of nodes to be unchoked, and the corresponding allocations, and thus does not require any empirically preset parameters like k. We demonstrate experimentally that Bit-Max can reduce significantly the download times in a typical reference scenario involving mostly ADSL nodes. We also consider scenarios involving network bottlenecks caused by filtering of P2P traffic at ISP peering points and show that BitMax retains its gains also in these cases.
- E. Altman, D. Barman, B. Tuffin, and M. Vojnovic. Parallel tcp sockets: Simple model, throughput and validation. In Proc. of IEEE INFOCOM '06, Barcelona, Spain, 2006.Google Scholar
Cross Ref
- Ashwin R. Bharambe, Cormac Herley, and Venkata N. Padmanabhan. Analyzing and improving a bittorrent networks performance mechanisms. In Proc. of IEEE INFOCOM '06, Barcelona, Spain, 2006.Google ScholarCross Ref
- R. Bindal, P. Cao, W. Chan, J. Medved, G. Suwala, T. Bates, and A. Zhang. Improving traffic locality in BitTorrent via biased neighbor selection. In Proc. of IEEE ICDCS '06, Lisbon, Portugal, 2006. Google ScholarDigital Library
- Bram Cohen. Incentives build robustness in BitTorrent. In Proc. of First Workshop on Economics of Peer-to-Peer Systems, Berkeley, CA, USA, Jun 2003.Google Scholar
- Michal Feldman, Kevin Lai, Ion Stoica, and John Chuang. Robust incentive techniques for peer-to-peer networks. In Proc. of ACM EC '04, New York, NY, USA, 2004. Google ScholarDigital Library
- W. Feller. An Introduction to Probability Theory and Its Applications. Wiley, New York, 1968.Google Scholar
- Christos Gkantsidis and Pablo Rodriguez. Network coding for large scale content distribution. In Proc. of IEEE INFOCOM '05, Miami, FL, USA, 2005.Google ScholarCross Ref
- Lei Guo, Songqing Chen, Zhen Xiao, Enhua Tan, Xiaoning Ding, and Xiaodong Zhang. Measurements, analysis, and modeling of bittorrent-like systems. In Proc. of ACM IMC'05, Berkeley, CA, 2005. Google ScholarDigital Library
- A. Al Hamra, A. Legout, and C. Barakat. Understanding the properties of the Bittorrent Overlay. Technical Report 00162088, version 1, Inria, July 2007.Google Scholar
- Nikolaos Laoutaris, Pablo Rodriguez, and Laurent Massoulie. ECHOS: edge capacity hosting overlays of nano data centers. ACM SIGCOMM Comput. Commun. Rev., 38(1): 51--54, 2008. Google ScholarDigital Library
- Arnaud Legout, Nikitas Liogkas, Eddie Kohler, and Lixia Zhang. Clustering and sharing incentives in bittorrent systems. In Proc. of ACM SIGMETRICS '07, 2007. Google ScholarDigital Library
- Arnaud Legout, G. Urvoy-Keller, and P. Michiardi. Rarest first and choke algorithms are enough. In Proc. of ACM IMC '06, Rio de Janeriro, Brazil, 2006. Google ScholarDigital Library
- Laurent Massoulie and Milan Vojnovic. Coupon replication systems. In Proc. of ACM SIGMETRICS '05, pages 2--13, Banff, Alberta, Canada, 2005. Google ScholarDigital Library
- Alberto Medina, Anukool Lakhina, Ibrahim Matta, and John Byers. BRITE: An Approach to Universal Topology Generation. In Proc. of MASCOTS '01, pages 346--354, Cincinnati, OH, Aug 2001. Google ScholarDigital Library
- J. J. D. Mol, J. A. Pouwelse, M. Meulpolder, D. H. J. Epema, and H. J. Sips. Give-to-get: An algorithm for P2P video-on-demand. In Proc. of SPIE/ACM MMCN '08, San Jose, California, Jan 2008.Google Scholar
- Christos H. Papadimitriou and Kenneth Steiglitz. Combinatorial optimization: Algorithms and complexity. New York, 1998. Dover Publications. Google ScholarDigital Library
- Michael Piatek, Tomas Isdal, Thomas Anderson, Arvind Krishnamurthy, and Arun Venkataramani. Do incentives build robustness in BitTorrent? In Proc. of NSDI'07, Cambridge, MA, 2007. Google ScholarDigital Library
- J. A. Pouwelse, P. Garbacki, D. H. J. Epema, and H. J. Sips. The BitTorrent P2P file-sharing system: Measurements and analysis. In Proc. of IPTPS'05, Ithaca, NY, 2005. Google ScholarDigital Library
- Dongyu Qiu and R. Srikant. Modeling and performance analysis of bittorrent-like peer-to-peer networks. In Proc. of ACM SIGCOMM '04, pages 367--378, 2004. Google ScholarDigital Library
- Slashdot. Comcast Hinders BitTorrent Traffic, Aug 2007.Google Scholar
- Weishuai Yang and Nael B. Abu-Ghazaleh. GPS: A general Peer-to-Peer simulator and its use for modeling BitTorrent. In in Proc. of MASCOTS'05, pages 425--434, Atlanta, GA, 2005. Google ScholarDigital Library
Index Terms
- Uplink allocation beyond choke/unchoke: or how to divide and conquer best
Recommendations
FairTorrent: bringing fairness to peer-to-peer systems
CoNEXT '09: Proceedings of the 5th international conference on Emerging networking experiments and technologiesPeer-to-Peer file-sharing applications suffer from a fundamental problem of unfairness. Free-riders cause slower download times for others by contributing little or no upload bandwidth while consuming much download bandwidth. Previous attempts to ...
Rarest first and choke algorithms are enough
IMC '06: Proceedings of the 6th ACM SIGCOMM conference on Internet measurementThe performance of peer-to-peer file replication comes from its piece and peer selection strategies. Two such strategies have been introduced by the BitTorrent protocol: the rarest first and choke algorithms. Whereas it is commonly admitted that ...
Bittorrent peer identification based on behaviors of a choke algorithm
AINTEC '08: Proceedings of the 4th Asian Conference on Internet EngineeringBittorrent is currently one of the most popular peer-to-peer (P2P) file sharing protocols. However, it incurs such excessive amount of traffic that it may adversely affect users of legacy internet applications. To limit this adverse impact, an efficient ...
Comments