Modeling Priority-Based Incentive Policies for Peer-Assisted Content Delivery Systems

  • Niklas Carlsson
  • Derek L. Eager
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4982)


Content delivery providers can improve their service scalability and offload their servers by making use of content transfers among their clients. To provide peers with incentive to transfer data to other peers, protocols such as BitTorrent typically employ a tit-for-tat policy in which peers give upload preference to peers that provide the highest upload rate to them. However, the tit-for-tat policy does not provide any incentive for a peer to stay in the system beyond completion of its download.

This paper presents a simple fixed-point analytic model of a priority-based incentive mechanism which provides peers with strong incentive to contribute upload bandwidth beyond their own download completion. Priority is obtained based on a peer’s prior contribution to the system. Using a two-class model, we show that priority-based policies can significantly improve average download times, and that there exists a significant region of the parameter space in which both high-priority and low-priority peers experience improved performance compared to with the pure tit-for-tat approach. Our results are supported using event-based simulations.


Modeling peer-assisted content delivery priority-based incentive 


  1. 1.
    Cohen, B.: Incentives Build Robustness in BitTorrent. In: Workshop on Economics of Peer-to-Peer Systems, Berkeley, CA (2003)Google Scholar
  2. 2.
    Gkantsidis, C., Rodriguez, P.R.: Network Coding for Large Scale Content Distribution. In: IEEE INFOCOM, Miami, FL (2005)Google Scholar
  3. 3.
    Sherwood, R., Braud, R., Bhattacharjee, B.: Slurpie: A Cooperative Bulk Data Transfer Protocol. In: IEEE INFOCOM, Hong Kong, China (2004)Google Scholar
  4. 4.
    Chu, Y., Rao, S.G., Zhang, H.: A Case for End System Multicast. In: ACM SIGMETRICS, Santa Clara, CA (2000)Google Scholar
  5. 5.
    Kozic, D., Rodriguez, A., Albrecht, J., Vahdat, A.: Bullet: High Bandwidth Data Dissemination Using an Overlay Mesh. In: ACM SOSP, Bolton Landing, NY (2003)Google Scholar
  6. 6.
    Zhang, X., Liu, J., Li, B., Yum, T.-S.P.: CoolStreaming/DONet: A Datadriven Overlay Network for Peer-to-Peer Live Media Streaming. In: IEEE INFOCOM, Miami, FL (2005)Google Scholar
  7. 7.
    Saroiu, S., Gummadi, K.P., Gribble, S.D.: A Measurement Study of Peer-to-Peer File Sharing Systems. In: IS&T/SPIE MMCN, San Jose, CA (2002)Google Scholar
  8. 8.
    Andrade, N., Mowbray, M., Lima, A., Wagner, G., Ripeanu, M.: Influences on Cooperation in BitTorrent Communities. In: ACM SIGCOMM Workshop on Economics of P2P Systems, Philadelphia, PA (2005)Google Scholar
  9. 9.
    Ripeanu, M., Mowbray, M., Andrade, N., Lima, A.: Gifting Technologies: A BitTorrent Case Study. First Monday 11, 11 (2006)Google Scholar
  10. 10.
    Clévenot-Perronnin, F., Nain, P., Ross, K.W.: Multiclass P2P Networks: Static Resource Allocation for Service Differentiation and Bandwidth Diversity. In: IFIP PERFORMANCE, Juan-les-Pins, France (2005)Google Scholar
  11. 11.
    Qiu, D., Srikant, R.: Modeling and Performance Analysis of BitTorrent-Like Peer-to-Peer Networks. In: ACM SIGCOMM, Portland, OR (2004)Google Scholar
  12. 12.
    Guo, L., Chen, S., Xiao, Z., Tan, E., Ding, X., Zhang, X.: Measurement, Analysis, and Modeling of BitTorrent-like Systems. In: ACM IMC, Berkley, CA (2005)Google Scholar
  13. 13.
    Kumar, R., Liu, Y., Ross, K.: Stochastic Fluid Theory for P2P Streaming Systems. In: IEEE INFOCOM, Anchorage, AK (2007)Google Scholar
  14. 14.
    Massoulie, L., Vojnovic, M.: Coupon Replication Systems. In: Proc. ACM SIGMETRICS, Banff, Canada (2005)Google Scholar
  15. 15.
    Lin, M., Fan, B., Chiu, D., Lui, J.C.S.: Stochastic Analysis of File Swarming Systems. In: IFIP PERFORMANCE, Cologne, Germany (2007)Google Scholar
  16. 16.
    Legout, A., Urvoy-Keller, G., Michiardi, P.: Rarest First and Choke Algorithms Are Enough. In: ACM IMC, Rio de Janeiro, Brazil (2006)Google Scholar
  17. 17.
    Legout, A., Liogkas, N., Kohler, E., Zhang, L.: Clustering and Sharing Incentives in BitTorrent Systems. In: ACM SIGMETRICS, San Diego, CA (2007)Google Scholar
  18. 18.
    Piatek, M., Isdal, T., Anderson, T., Krishnamurthy, A., Venkataramani, A.: Do Incentives Build Robustness in BitTorrent? In: NSDI, Cambridge, MA (2007)Google Scholar
  19. 19.
    Kamvar, S.D., Schlosser, M.T., Garcia-Molina, H.: The Eigentrust Algorithm for Reputation Management in P2P Networks. In: WWW, Budapest, Hungary (2003)Google Scholar
  20. 20.
    Zhong, S., Chen, J., Yang, Y.R.: Sprite: a Simple, Cheat-Proof, Credit-Based System for Mobile Ad-hoc Networks. In: IEEE INFOCOM, San Francisco, CA (2003)Google Scholar
  21. 21.
    Chu, Y., Chuang, J., Zhang, H.: A Case for Taxation in Peer-to-Peer Streaming Broadcast. In: ACM SIGCOMM Workshop on Practice and Theory of Incentives in Networked Systems, Portland, OR (2004)Google Scholar
  22. 22.
    Carlsson, N., Eager, D.L.: Peer-assisted On-demand Streaming of Stored Media using BitTorrent-like Protocols. In: IFIP/TC6 NETWORKING, Atlanta, GA (2007)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2008

Authors and Affiliations

  • Niklas Carlsson
    • 1
  • Derek L. Eager
    • 1
  1. 1.Department of Computer ScienceUniversity of SaskatchewanSaskatoonCanada

Personalised recommendations