The problem of upload competition in peer-to-peer systems with incentive mechanisms
Article first published online: 2 MAY 2012
Copyright © 2012 John Wiley & Sons, Ltd.
Concurrency and Computation: Practice and Experience
Volume 25, Issue 7, pages 899–917, May 2013
How to Cite
Meulpolder, M., Meester, L.E. and Epema, D.H.J. (2013), The problem of upload competition in peer-to-peer systems with incentive mechanisms. Concurrency Computat.: Pract. Exper., 25: 899–917. doi: 10.1002/cpe.2856
- Issue published online: 17 APR 2013
- Article first published online: 2 MAY 2012
- Manuscript Accepted: 14 APR 2012
- Manuscript Revised: 23 DEC 2011
- Manuscript Received: 26 AUG 2011
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 sharing ratio becomes too low. Interestingly, recent measurements have shown that such systems tend to have an oversupply 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 upload. 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 uploader selection 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.