Towards a Peer-to-Peer Bandwidth Marketplace

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8314)


Peer-to-peer systems are a popular means of transferring files over the Internet, accounting for a third of the upload bandwidth of end users as of 2013. However, recent studies have highlighted that peer-to-peer systems are affected by a lack of balance between the supply and demand of bandwidth. This imbalance stems from the skewed popularity distribution of the files transfered in the system; newly released files may exhibit an undersupply of bandwidth while older ones may exhibit oversupply. In this work, we introduce a bandwidth marketplace for peers, with the aim of aligning supply and demand without the need for human intervention. Peers constantly monitor their performance and gossip with each other about undersupplied files. Peers with idle upload bandwidth that learn about an undersupplied file can autonomously start a special help mode download, with the goal of supplying as much upload bandwidth as possible to the other peers. We present an analytical model of help mode downloading and derive from it bounds for the performance of helper peers. Furthermore, we evaluate a recent existing implementation of help mode in Libtorrent, a popular BitTorrent library. Our tests show that Libtorrent help mode is effective at alleviating undersupply, although its performance relative to our model can be improved.


Upload Bandwidth Sharing Ratio Download Speed Normal Peer Upload Speed 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
  2. 2.
  3. 3.
    Aperjis, C., Freedman, M.J., Johari, R.: Peer-assisted content distribution with prices. In: CONEXT, pp. 1–12. ACM (2008)Google Scholar
  4. 4.
    Chen, Z., Chen, Y., Lin, C., Nivargi, V., Cao, P.: Experimental Analysis of Super-Seeding in BitTorrent. In: ICC, pp. 65–69. IEEE (2008)Google Scholar
  5. 5.
    Cohen, B.: Incentives build robustness in BitTorrent. In: P2PEcon (2003)Google Scholar
  6. 6.
    Dán, G., Carlsson, N.: Centralized and Distributed Protocols for Tracker-Based Dynamic Swarm Management. IEEE/ACM TON 21(1), 297–310 (2013)CrossRefGoogle Scholar
  7. 7.
    Garbacki, P., Epema, D., Van Steen, M.: An amortized tit-for-tat protocol for exchanging bandwidth instead of content in p2p networks. In: SASO. IEEE (2007)Google Scholar
  8. 8.
    Guo, L., Chen, S., Xiao, Z., Tan, E., Ding, X., Zhang, X.: A performance study of BitTorrent-like peer-to-peer systems. IEEE JSAC 25(1), 155–169 (2007)Google Scholar
  9. 9.
    Jia, A.L., Chen, X., Chu, X., Pouwelse, J.A., Epema, D.H.J.: How to Survive and Thrive in a Private BitTorrent Community. In: Frey, D., Raynal, M., Sarkar, S., Shyamasundar, R.K., Sinha, P. (eds.) ICDCN 2013. LNCS, vol. 7730, pp. 270–284. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  10. 10.
    Kash, I.A., Lai, J.K., Zhang, H., Zohar, A.: Economics of BitTorrent communities. In: WWW, pp. 221–230. ACM (2012)Google Scholar
  11. 11.
    Katti, S., Katabi, D., Blake, C., Kohler, E., Strauss, J.: MultiQ. In: IMC, pp. 245–250. ACM (2004)Google Scholar
  12. 12.
    Legout, A., Liogkas, N., Kohler, E., Zhang, L.: Clustering and sharing incentives in BitTorrent systems. In: SIGMETRICS, pp. 301–312. ACM (2007)Google Scholar
  13. 13.
    Peterson, R.S., Sirer, E.G.: Antfarm: efficient content distribution with managed swarms. NSDI, pp. 107–122. USENIX (2009)Google Scholar
  14. 14.
    Qiu, D., Srikant, R.: Modeling and performance analysis of BitTorrent-like peer-to-peer networks. ACM SIGCOMM Comput. Commun. Rev. 34(4), 367–378 (2004)CrossRefGoogle Scholar
  15. 15.
    Sandvine: Global Internet Phenomena Report 1H2013Google Scholar
  16. 16.
    Wu, D., Liu, Y., Ross, K.W.: Modeling and analysis of multichannel P2P live video systems. IEEE/ACM TON 18(4), 1248–1260 (2010)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  1. 1.Delft University of TechnologyThe Netherlands

Personalised recommendations