• DocumentCode
    2697343
  • Title

    CompactPSH: An efficient transitive TFT incentive scheme for Peer-to-Peer Networks

  • Author

    Bocek, Thomas ; Hecht, Fabio Victora ; Hausheer, David ; Stiller, Burkhard ; El-khatib, Yehia

  • Author_Institution
    Dept. of Inf. IFI, Univ. of Zurich, Zurich, Switzerland
  • fYear
    2009
  • fDate
    20-23 Oct. 2009
  • Firstpage
    483
  • Lastpage
    490
  • Abstract
    Incentive schemes in Peer-to-Peer (P2P) networks are necessary to discourage free-riding. One example is the Tit-for-Tat (TFT) incentive scheme, a variant of which is used in BitTorrent to encourage peers to upload. TFT uses data from local observations making it suitable for systems with direct reciprocity. This paper presents CompactPSH, an incentive scheme that works with direct and indirect reciprocity. CompactPSH allows peers to establish indirect reciprocity by finding intermediate peers, thus enabling trade with more peers and capitalizing on more resources. CompactPSH finds transitive paths while keeping the overhead of additional messages low. In a P2P file-sharing scenario based on input data from a large BitTorrent tracker, CompactPSH was found to exploit more reciprocity than TFT which enabled more chunks to be downloaded. As a consequence, peers are allowed to be stricter to fight white-washing without compromising performance.
  • Keywords
    peer-to-peer computing; BitTorrent tracker; CompactPSH; P2P file-sharing scenario; peer-to-peer networks; tit-for-tat incentive scheme; Computer networks; Fault tolerant systems; History; Incentive schemes; Informatics; Load management; Peer to peer computing; Robustness; Scalability; Thin film transistors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Local Computer Networks, 2009. LCN 2009. IEEE 34th Conference on
  • Conference_Location
    Zurich
  • Print_ISBN
    978-1-4244-4488-5
  • Electronic_ISBN
    978-1-4244-4487-8
  • Type

    conf

  • DOI
    10.1109/LCN.2009.5355173
  • Filename
    5355173