Skip to main content
SpringerLink
Log in

iRep: indirect reciprocity reputation based efficient content delivery in BT-like systems

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

Delivering content efficiently through biased neighbor selection has attracted a lot of researchers’ attention in recent years. Meanwhile, how to help peers understand each other is a crucial precondition of biased neighbor selection in distributed P2P context. Recent researches have showed that reciprocation based schemes provide a feasible way of categorizing peers. These schemes can perform in direct or indirect ways. For example, tit-for-tat is a typical example of direct ways, while reputation-based schemes are the representative examples of indirect ways. Although tit-for-tat has been proved to be successful from practical deployment and academic studies, it still suffers from free-riding, malicious peers and other problems. On the other hand, reputation-based schemes pay little attention to malicious peers. However, in this paper we propose an approach to promote the whole system performance as well as cope with malicious peers. Firstly, by building a simple mathematical model for the content delivery process in BT-like system, we find that the delivery order is critical to system performance, after that we present the best selection policy from system and single peer’s perspective respectively. Secondly, according to analysis results, we bring forward indirect reciprocate Reputation (iRep), detail the design issues and sketch security and overhead introduced by iRep. Finally, several simulation experiments are conducted to evaluate the performance of iRep through comparison with tit-for-tat and Eigentrust. The comparison results validate that iRep can efficiently promote system performance with limited overheads.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Algorithm 1
Algorithm 2
Algorithm 3
Algorithm 4
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  1. http://www.bittorrent.com.

  2. Parker, A. (2007). The true picture of peer-to-peer file sharing. URL: http://www.cachelogic.com/. Accessed February 2007.

  3. Shah, P., & Pris, J.-F. (2007). Peer-to-peer multimedia streaming using BitTorrent. In IPCCC 2007, New Orleans, USA, April 2007.

    Google Scholar 

  4. Parvez, N., Williamson, C., Mahanti, A., & Carlsson, N. (2008). Analysis of BitTorrent-like protocols for on-demand stored media streaming. In Proc. of ACM SIGMETRICS, Jun. 2008.

    Google Scholar 

  5. Sherwood, R., Braud, R., & Bhattacharjee, B. (2004). Slurpie: a cooperative bulk data transfer protocol. In IEEE INFOCOM, Hong Kong, HK, 2004.

    Google Scholar 

  6. Qiu, D., & Srikant, R. (2004). Modeling and performance analysis of bittorrent-like peer-to-peer networks. In ACM SIGCOMM, August 2004.

    Google Scholar 

  7. Liao, W.-C., Papadopoulos, F., & Psounis, K. (2007). Performance analysis of bittorrent-like systems with heterogeneous users. Performance Evaluation 64, 876–891.

    Article  Google Scholar 

  8. Cohen, B. (2003). Incentives build robustness in bitorrent. In Proceedings of the 1st workshop on economics of peer-to-peer systems.

    Google Scholar 

  9. Bharambe, A., & Herley, C. (2005). Analyzing and improving BitTorrent performance (Technical Report MSR-TR-2005-03). Microsoft Research.

  10. Piatek, M., Isdal, T., Anderson, T., Krishnamurthy, A., & Venkataramani, A. (2007). Do incentives build robustness in BitTorrent? In NSDI, April 2007.

    Google Scholar 

  11. Park, J., Schaar, M. V. D. (2007). Pricing and incentives in peer-to-peer networks. In IEEE conference on computer communications (INFOCOM).

    Google Scholar 

  12. Menasche, D., Massoulie, L., & Towsley, D. (2010). Reciprocity and barter in peer-to-peer systems. In IEEE conference on computer communications (INFOCOM).

    Google Scholar 

  13. Chow, A. L. H., Golubchik, L., & Misra, V. (2009). BitTorrent: an extensible heterogeneous model. In Proc. IEEE INFOCOM.

    Google Scholar 

  14. Erman, D., Saavedra, D., & Sánchez, J. Á. (2008). Validating BitTorrent models. Telecommunications Systems, 39, 103–116.

    Article  Google Scholar 

  15. Adar, E., & Huberman, B. (2000). Free riding on Gnutella (Technical report). Xerox PARC, August 2000.

  16. Ripeanu, M., Foster, I., & Iamnitchi, A. (2002). Mapping the Gnutella network: properties of large-scale peer-to-peer systems and implications for system design. IEEE Internet Computing, 6(1), 50–57. Special issue on peer-to-peer networking.

    Article  Google Scholar 

  17. Saroiu, S., Gummadi, P. K., & Gribble, S. D. (2002). A measurement study of peer-to-peer file sharing systems. In Proceedings of multimedia computing and networking 2002 (MMCN’02), January 2002.

    Google Scholar 

  18. Legout, A., Liogkas, N., Kohler, E., & Zhang, L. (2007). Clustering and sharing incentives in BitTorrent systems. In SIGMETRICS perform. eval. rev.

    Google Scholar 

  19. Piatek, M., Isdal, T., Krishnamurthy, A., & Anderson, T. (2008). One hop reputations for peer to peer file sharing workloads. In Proceedings of the 5th USENIX symposium on networked systems design and implementation (NSDI ’08), San Francisco, CA, USA, April 2008 (pp. 1–14).

    Google Scholar 

  20. Satsiou, A., & Tassiulas, L. (2010). Reputation-based resource allocation in P2P systems of rational users. IEEE Transactions on Parallel and Distributed Systems, 21(4), 466–479.

    Article  Google Scholar 

  21. Gupta, M., Judge, P., & Ammar, M. (2003). A reputation system for peer-to-peer networks. In Proceedings of the 13th international workshop on network and operating systems support for digital audio and video (NOSSDAV).

    Google Scholar 

  22. Feldman, M., Lai, K., Stoica, I., & Chuang, J. (2004). Robust incentive techniques for peer-to-peer networks. In Proc. of the 5th ACM conference on electronic commerce (EC’04), May 2004 (pp. 102–111).

    Chapter  Google Scholar 

  23. Marti, S., & Garcia-Molina, H. (2006). Taxonomy of trust: categorizing P2P reputation systems. Computer Networks, 50, 472–484.

    Article  Google Scholar 

  24. Marti, S., & Garcia-Molina, H. (2004). Limited reputation sharing in P2P systems. In ACM conference on electronic commerce, New York, USA, 2004 (pp. 91–101).

    Google Scholar 

  25. Nowak, M. A., & Martin, A. (2006). Five rules for the evolution of cooperation. Science, 314, 1560–1563.

    Article  Google Scholar 

  26. Nowak, M. A., Martin, A., & Karl, S. (1998). Evolution of indirect reciprocity by image scoring. Nature, 393, 573–576.

    Article  Google Scholar 

  27. Ohtsuki, H., Iwasa, Y., & Nowak, M. A. (2009). Indirect reciprocity provides only a narrow margin of efficiency for costly punishment. Nature, 457, 79–82.

    Article  Google Scholar 

  28. Landa, R., Griffin, D., Clegg, R., Mykoniati, E., & Rio, M. (2009). A sybilproof indirect reciprocity mechanism for peer-to-peer networks. In Proceedings of IEEE INFOCOM ’09.

    Google Scholar 

  29. Hoffman, K., Zage, D., & Nita-Rotaru, C. (2007). A survey of attack and defense techniques for reputation systems. Purdue CSD TR #07-013.

  30. Al-Hamra, A., Legout, A., & Barakat, C. (2007). Understanding the properties of the bittorrent overlay (INRIA, Tech. Rep.). [Online]. Available: http://arxiv.org/pdf/0707.1820.

  31. Kamvar, S. D., Schlosser, M. T., & Garcia-Molina, H. (2003). The eigentrust algorithm for reputation management in P2P networks. In Proc. of WWW.

    Google Scholar 

  32. Zhang, C., Dhungel, P., Wu, D., & Ross, K. W. (2010). Unraveling the BitTorrent ecosystem. IEEE Transactions on Parallel and Distributed Systems, 22, 1164–1177.

    Article  Google Scholar 

  33. Yu, L., & Chen, M. (2010). Geographical distribution of peers of BitTorrent in multi-granularity scale. In Proc. international conference on computer & communication technology (ICCCT’2010), Allahabad, India, 2010.

    Google Scholar 

  34. Neglia, G., Reina, G., Zhang, H., Towsley, D., Venkataramani, A., & Danaher, J. (2007). Availability in BitTorrent systems. In IEEE conference on computer communications (INFOCOM).

    Google Scholar 

  35. Feldman, M., Papadimitriou, C., & Chuang, J. (2004). Free-riding and whitewashing in peer-to-peer systems. In Proc. PINS (pp. 228–236). New York: ACM.

    Chapter  Google Scholar 

  36. Koo, S. G. M., & Lee, C. S. G. (2007). An incentive-compatible mechanism for efficient distribution of bulk contents on peer-to-peer networks. Telecommunications Systems, 34, 81–90.

    Article  Google Scholar 

  37. Chu, X., Chen, X., Zhao, K., & Liu, J. (2010). Reputation and trust management in heterogeneous peer-to-peer networks. Telecommunications Systems, 44, 191–203.

    Article  Google Scholar 

  38. Gupta, M., Ammar, M. H., & Ahamad, M. (2006). Trade-offs between reliability and overheads in peer-to-peer reputation tracking. Computer Networks, 50(4), 501–522.

    Article  Google Scholar 

  39. Zhang, Y., & Fang, Y. (2007). A fine-grained reputation system for reliable service selection in peer-to-peer networks. IEEE Transactions on Parallel and Distributed Systems, 18(8), 1134–1145.

    Article  Google Scholar 

  40. Liu, Z., Hu, H., Liu, Y., Ross, K. W., Wang, Y., & Mobius, M. (2010). P2P trading in social networks: the value of staying connected. In IEEE conference on computer communications (INFOCOM).

    Google Scholar 

  41. Wang, Y., & Nakao, A. (2010). PoisonedWater: an improved approach for accurate reputation ranking in P2P networksP2P networks. Journal of Future Generation Computer Systems, 26(8), 1317–1326.

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported in part by the National Natural Science Foundation of China under Grant No. 61070173, the National High-Tech Research and Development Plan of China under Grant No. 2007AA01Z418, Jiangsu Province Natural Science Foundation of China under Grant No. BK2010133 and Jiangsu Province Natural Science Foundation of China under Grant No. BK2009058. We thank Prof. Keith W. Ross (Polytechnic Institute of NYU), Yong Liu (Polytechnic Institute of NYU), Fangfang Wei (The Chinese University of Hong Kong), Tarem Ahmed (BRAC University), Prof. Al-Sakib Khan Pathan (International Islamic University Malaysia) and the anonymous reviewers of Telecommunication Systems Journal for many helpful comments on the paper.

Author information

Authors and Affiliations

  1. Nanjing Telecommunication Technology Research Institute, Nanjing, China

    Xianglin Wei

  2. College of Command Information Systems, PLA University of Science and Technology, Nanjing, China

    Ming Chen, Huali Bai, Guomin Zhang & Zhanfeng Wang

  3. Department of Computer Science and Technology, University of Science and Technology of China, Hefei, China

    Chaogang Tang

Authors
  1. Xianglin Wei
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ming Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chaogang Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Huali Bai
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Guomin Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Zhanfeng Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xianglin Wei.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wei, X., Chen, M., Tang, C. et al. iRep: indirect reciprocity reputation based efficient content delivery in BT-like systems. Telecommun Syst 54, 47–60 (2013). https://doi.org/10.1007/s11235-013-9715-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-013-9715-0

Keywords

Search

Navigation