Fair incentive mechanism with pyramidal structure for peer-to-peer networks

Buy article PDF
  • Author(s): Y. Liu 1 ; N. Xiong 2 ; J.H. Park 3 ; C. Yang 1 ; K. Xu 4
    • View affiliations
    • Affiliations: 1: Department of Computer Science, Huazhong Normal University , Wuhan , People's Republic of China
      2: Department of Computer Science, Georgia State University , Atlanta , USA
      3: Department of Computer Science and Engineering, Kyungnam University , Kyungnam , South Korea
      4: Research Center of the Digital Space Technology, Huazhong Normal University , Wuhan , People's Republic of China
  • Source: IET Communications, Volume 4, Issue 1, 5 January 2010, p. 1 – 12, DOI: 10.1049/iet-com.2008.0702, Print ISSN 1751-8628, Online ISSN 1751-8636
© The Institution of Engineering and Technology
Published 31/07/2012

Abstract

Free-riding is a grave threat against the existence and efficient operation of peer-to-peer networks. This study proposes a rank-based fair incentive mechanism to restrain free-riding and solve the problem of the tragedy of the commons. In this mechanism, each user has a rank according to its utility value and it can just visit the corresponding rating files with its rank in the system. The utility function in this study takes the absolute contribution value and the physical performance into account for fairness and their values are calculated by the analytic hierarchy process. Besides, a pyramidal rank structure is constructed in this mechanism, and the computation formula for the node's transfer in each layer is established. In addition, the four defects in other restrain mechanisms are resolved in this incentive mechanism. The simulations in three aspects have verified that this mechanism is effective and practical.

Inspec keywords: peer-to-peer computing

Other keywords: pyramidal structure; peer-to-peer networks; fair incentive mechanism

Subjects: Computer communications; Distributed systems software

References

    1. 1)
    2. 2)
      • Adar, E., Huberman, B.: `Free riding on Gnutella', First Monday, 2000, 5, (10), p. 134-139
    3. 3)
    4. 4)
      • Karakaya, M., Korpeouglu, I., Ulusoy, O.: `A distributed and measurement based framework against free riding in peer-to-peer networks', Proc. Int. Conf. Peer-to-Peer Computing, August 2004, Zurich, Switzerland, p. 276–277
    5. 5)
    6. 6)
    7. 7)
    8. 8)
      • Meng, S., Shi, C., Han, D., Zhu, X., Yu, Y.: `A statistical study of today's Gnutella', Proc. Asia-Pacific Web Conf, January 2006, Harbin, China, p. 189–200
    9. 9)
      • Tao, S., Liu, Y., Xu, K., Tan, D.: `The strategies against vulnerability of hubs in complex networks', Comp. Eng. Appl., 2007, 43, (2), p. 151-153
    10. 10)
      • Liu, Y., Yang, C., Xu, K., Chen, H.: `Model of controlling the hubs in P2P network', Proc. Int. Conf. Science and Engineering, January 2008, Harbin, China, p. 417–422
    11. 11)
    12. 12)
      • Ramaswamy, L., LiU, L.: `Free riding: a new challenge to peer-to-peer file sharing systems', Proc. Int. Conf. System Sciences, January 2003, Big Island, HI, USA, p. 220–229
    13. 13)
      • Ahsan, H., John, C.: `An incentive mechanism for peer-to-peer media streaming', Proc. Int. Workshop Quality of Service, June 2004, Montreal, Canada, p. 171–180
    14. 14)
      • Anceaume, E., Gradinariu, M., Ravoajia, A.: `Incentive for P2P fair resource sharing', Proc. Int. Conf. Peer-to-Peer Computing, 2005, Konstanz, p. 253–260
    15. 15)
    16. 16)
      • Gupta, R., Somani, A.K.: `Game theory as a tool to strategize as well as predict nodes’ behavior in peer-to-peer networks', Proc. Int. Conf. Parallel and Distributed Systems, 2005, Fukuoka, Japan, p. 244–249
    17. 17)
    18. 18)
      • Lui, S.M., Lang, K.R., Kwok, S.H.: `Participation incentive mechanisms in peer-to-peer subscription systems', Proc. Int. Conf. System Sciences, 2002, Hawaii, p. 3925–3931
    19. 19)
      • Figueiredo, D., Shapiro, J., Towsley, D.: `Incentives to promote availability in peer-to-peer anonymity systems', Proc. Int. Conf. Network Protocols, 2005, Boston, p. 110–121
    20. 20)
    21. 21)
    22. 22)
      • Krishnan, R., Smith, M.D., Tang, Z.L.: `The impact of free-riding on peer-to-peer networks', Proc. Int. Conf. System Sciences, 2004, Hawaii, p. 199–208
    23. 23)
    24. 24)
      • Satty, T.L.: The analytic hierarchy process, 1980 (McGraw-HillNew York)
    25. 25)
      • The Gnutella Protocol Spec. v0.4 1, document revision 1.2.: http://www.clip2.com, accessed May 2008
    26. 26)
      • Liu, Y., Yang, C., Tan, L., Tao, S.: `A generalized B-A model for the recognition of intermediate vertex effect', Dyn. Continuous Discret. Impulsive Syst., Ser. B, 2007, 14, p. 23-27
Print this page
This is a required field
Please enter a valid email address