Mitigating routing misbehavior in mobile ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Incentives for sharing in peer-to-peer networks
Proceedings of the 3rd ACM conference on Electronic Commerce
Tangler: a censorship-resistant publishing system based on document entanglements
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Managing trust in a peer-2-peer information system
Proceedings of the tenth international conference on Information and knowledge management
Fast and secure distributed read-only file system
ACM Transactions on Computer Systems (TOCS)
Performance analysis of the CONFIDANT protocol
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Distributed algorithmic mechanism design: recent results and future directions
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
Samsara: honor among thieves in peer-to-peer storage
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
SHARP: an architecture for secure resource peering
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Measurement, modeling, and analysis of a peer-to-peer file-sharing workload
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
SLIC: A Selfish Link-Based Incentive Mechanism for Unstructured Peer-to-Peer Networks
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Exchange-Based Incentive Mechanisms for Peer-to-Peer File Sharing
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
SeAl: Managing Accesses and Data in Peer-to-Peer Sharing Networks
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Secure routing for structured peer-to-peer overlay networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Sustaining cooperation in multi-hop wireless networks
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
High-bandwidth mesh-based overlay multicast in heterogeneous environments
AAA-IDEA '06 Proceedings of the 2nd international workshop on Advanced architectures and algorithms for internet delivery and applications
PeerReview: practical accountability for distributed systems
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
OSDI '06 Proceedings of the 7th symposium on Operating systems design and implementation
Dandelion: cooperative content distribution with robust incentives
ATC'07 2007 USENIX Annual Technical Conference on Proceedings of the USENIX Annual Technical Conference
Securing peer-to-peer media streaming systems from selfish and malicious behavior
Proceedings of the 4th on Middleware doctoral symposium
Evaluation of P2P Algorithms for Probabilistic Trust Inference in a Web of Trust
EPEW '08 Proceedings of the 5th European Performance Engineering Workshop on Computer Performance Engineering
Improve peer cooperation using social networks
International Journal of Parallel, Emergent and Distributed Systems
A survey of attack and defense techniques for reputation systems
ACM Computing Surveys (CSUR)
Tree-based analysis of mesh overlays for peer-to-peer streaming
DAIS'08 Proceedings of the 8th IFIP WG 6.1 international conference on Distributed applications and interoperable systems
Communications of the ACM
Resisting free-riding behavior in BitTorrent
Future Generation Computer Systems
Recruiting new tor relays with BRAIDS
Proceedings of the 17th ACM conference on Computer and communications security
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
Addressing common vulnerabilities of reputation systems for electronic commerce
Journal of Theoretical and Applied Electronic Commerce Research
Analytical evaluation of P2P reputation systems
International Journal of Communication Networks and Distributed Systems
DCast: sustaining collaboration in overlay multicast despite rational collusion
Proceedings of the 2012 ACM conference on Computer and communications security
Sophia: A local trust system to secure key-based routing in non-deterministic DHTs
Journal of Parallel and Distributed Computing
Understanding the effects of P2P dynamics on trust bootstrapping
Information Sciences: an International Journal
Hi-index | 0.02 |
Cooperative peer-to-peer (p2p) applications are designed to share the resources of participating computers for the common good of all users. However, users do not necessarily have an incentive to donate resources to the system if they can use the system's services for free. In this paper, we describe Scrivener, a fully decentralized system that ensures fair sharing of bandwidth in cooperative content distribution networks. We show how participating nodes, tracking only first-hand observed behavior of their peers, can detect when their peers are behaving selfishly and refuse to provide them service. Simulation results show that our mechanisms effectively limit the quality of service received by a user to a level that is proportional to the amount of resources contributed by that user, while incurring modest overhead.