• DocumentCode
    2750681
  • Title

    A Review of Incentive Mechanism in Peer-to-Peer Systems

  • Author

    Zhang, Kan ; Antonopoulos, Nick ; Mahmood, Zaigham

  • Author_Institution
    Sch. of Comput., Univ. of Derby, Derby, UK
  • fYear
    2009
  • fDate
    11-16 Oct. 2009
  • Firstpage
    45
  • Lastpage
    50
  • Abstract
    Free riders in the peer-to-peer (P2P) networks are nodes that only consume services but provide little or nothing in return. They seriously degrade the fault-tolerance, scalability and content availability of the P2P systems. The solution to free riding problem in P2P networks is to have incentive mechanisms that aim to improve the network utility by influencing the nodes to be more cooperative. This paper proposes five design requirements that an incentive mechanism should satisfy and suggests that the existing incentive mechanisms can be classified into three categories: monetary-based, fixed contribution and reciprocity-based schemes. The paper outlines the principles, provides typical examples and applications and discusses limitations of these schemes. The applicability of each scheme is also discussed against the proposed deign requirements. The aim is to provide an overview and guidance to enhance the applicability of incentive mechanisms in P2P systems.
  • Keywords
    fault tolerance; incentive schemes; peer-to-peer computing; P2P network; P2P system; content availability; design requirement; fault-tolerance; fixed contribution; incentive mechanism; monetary-based incentive; network utility; peer-to-peer system; reciprocity-based scheme; system scalability; Computer networks; Degradation; Fault tolerance; Fault tolerant systems; Internet telephony; Network servers; Peer to peer computing; Scalability; Streaming media; Utility programs; Free riding; Incentive Mechanism; Peer-to-Peer;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Advances in P2P Systems, 2009. AP2PS '09. First International Conference on
  • Conference_Location
    Sliema
  • Print_ISBN
    978-1-4244-5084-8
  • Electronic_ISBN
    978-0-7695-3831-0
  • Type

    conf

  • DOI
    10.1109/AP2PS.2009.15
  • Filename
    5359135