12,000

We have over 12,000 students, from over 100 countries, within one of the safest campuses in the UK

93%

93% of Lancaster students go into work or further study within six months of graduating

Home > Research > Publications & Outputs > CompactPSH: An Efficient Transitive TFT Incenti...
View graph of relations

« Back

CompactPSH: An Efficient Transitive TFT Incentive Scheme for Peer-to-Peer Networks

Research output: Contribution in Book/Report/ProceedingsPaper

Published

  • Thomas Bocek
  • Fabio Victora Hecht
  • David Hausheer
  • Burkhard Stiller
  • Yehia El-khatib
Publication date10/2009
Host publicationLocal Computer Networks, 2009. LCN 2009. IEEE 34th Conference on
PublisherIEEE
Pages483-490
Number of pages8
ISBN (Electronic)978-1-4244-4487-8
ISBN (Print)978-1-4244-4488-5
Original languageEnglish

Conference

ConferenceThe 34th Annual IEEE Conference on Local Computer Networks (LCN)
CityZürich, Switzerland
Period1/01/00 → …

Conference

ConferenceThe 34th Annual IEEE Conference on Local Computer Networks (LCN)
CityZürich, Switzerland
Period1/01/00 → …

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.