• DocumentCode
    3270436
  • Title

    Incentive framework using Shapley value for BitTorrent-like systems

  • Author

    Chen, Xiaowei ; Chu, Xiaowen ; Chang, Xiaolei

  • Author_Institution
    Comput. Sci. Dept., Hong Kong Baptist Univ., Hong Kong, China
  • fYear
    2009
  • fDate
    8-10 Dec. 2009
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    BitTorrent is the dominating protocol in nearly all regions. Various reputation models and incentive mechanisms are proposed in recent years. However, many of them are designed for general peer-to-peer networks, only a few are designed for BitTorrent even though some models and mechanisms assert that they can be applied to BitTorrent-like systems. In this paper, we propose an incentive framework based on reputation history instead of tit-for-tat in BitTorrent. It is derived from the coalition games concept of Shapley value that will encourage selfish peers who seek to maximize their own profits to converge to Nash equilibrium. We show that this profit sharing framework exhibits several fairness properties that support the argument that this distribution of profit is desirable. Moreover, we improve SepRep reputation model and tailor it to the needs of BitTorrent protocol. In particular, we utilize the tracker of BitTorrent to process global reputation and trust values assisting the local values maintained by each peer.
  • Keywords
    peer-to-peer computing; protocols; BitTorrent protocol; Shapley value; coalition games concept; general peer-to-peer networks; incentive framework; reputation history; Availability; Computer science; History; Monitoring; Nash equilibrium; Peer to peer computing; Protocols; Robustness; Scalability; Telecommunication traffic; BitTorrent; Shapley value; incentive; peer-to-peer network; reputation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information, Communications and Signal Processing, 2009. ICICS 2009. 7th International Conference on
  • Conference_Location
    Macau
  • Print_ISBN
    978-1-4244-4656-8
  • Electronic_ISBN
    978-1-4244-4657-5
  • Type

    conf

  • DOI
    10.1109/ICICS.2009.5397601
  • Filename
    5397601