The problem of upload competition in peer‐to‐peer systems with incentive mechanisms. (3rd May 2012)

• Record Type: Journal Article
• Authors: Meulpolder, M.; Meester, L.E.; Epema, D.H.J.
• Is Part Of: Concurrency and computation. Volume 25:Number 7(2013:May)
• Page Start: 899
• Page End: 917
• Publication Date: 2012-05-03
• Subjects: Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.2856
• Languages: English
• ISSNs: 1532-0626

Abstract

<abstract abstract-type="main" id="cpe2856-abs-0001"> <title>SUMMARY</title> <p id="cpe2856-para-0001">As peer‐to‐peer (P2P) file‐sharing systems revolve around cooperation, the design of upload incentives has been one of the most important topics in P2P research for more than a decade. Several deployed systems, such as private BitTorrent communities, successfully manage to foster cooperation by banning peers when their <italic>sharing ratio</italic> becomes too low. Interestingly, recent measurements have shown that such systems tend to have an <italic>oversupply</italic> instead of an undersupply of bandwidth designers that have been obsessed with since the dawn of P2P. In such systems, the 'selfish peer' problem is finally solved, but a new problem has arisen: because peers have to keep up their sharing ratios, they now have to compete to <italic>upload</italic>. In this paper, we explore this new problem and show how even highly cooperative peers might in the end not survive the upload competition. On the basis of recent measurements of over half a million peers in private P2P communities, we propose and analyze several algorithms for <italic>uploader selection</italic> under oversupply. Our algorithms enable sustained sharing ratio enforcement and are easy to implement in both existing and new systems. Overall, we offer an important design consideration for the new generation of P2P systems in which selfishness is no longer an issue. Copyright © 2012 John Wiley & Sons, Ltd.</p> </abstract>