Uplink allocation beyond choke/unchoke: or how to divide and conquer best

Motivated by emerging cooperative P2P applications we study new uplink allocation algorithms for substituting the ratebased 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 BitMax 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 BitMa...

• Type: Conference
• Year: 2008
• Where: CONEXT
• Authors: Nikolaos Laoutaris, Damiano Carra, Pietro Michiardi
• Keywords: Computer Networks, CONEXT 2008, Download Times, Uplink Allocation Algorithms, Uplink Utilization