Scrivener: Providing Incentives in Cooperative Content Distribution Systems
Lecture notes in computer sciencePublished 1 January 2005
Animesh Nandi, Tsuen‐Wan Ngan, Atul Singh, Peter Druschel, Dan S. Wallach
Citations59
SJR quartileQ2
SJR score0.35
SNIP0.55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Scrivener is described, a fully decentralized system that ensures fair sharing of bandwidth in cooperative content distribution networks and shows how participating nodes, tracking only first-hand observed behavior of their peers, can detect when their peers are behaving selfishly and refuse to provide service.
Abstract
Abstract. 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. 1
Keywords
Computer Science
Chord
9,645 Citations2001Ion Stoica, Robert Morris +3 more
Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.
Lecture notes in computer sciencePastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
7,296 Citations2001Antony Rowstron, Peter Druschel
Experimental results obtained with a prototype implementation on an emulated network of up to 100,000 nodes confirm Pastry's scalability and efficiency, its ability to self-organize and adapt to node failures, and its good network locality properties.
Journal of Natural Resources Policy ResearchThe Tragedy of the Commons*
6,408 Citations2009Garrett Hardin
Lecture notes in computer scienceThe Sybil Attack
4,328 Citations2002John R. Douceur
It is shown that, without a logically centralized authority, Sybil attacks are always possible except under extreme and unrealistic assumptions of resource parity and coordination among entities.
Mitigating routing misbehavior in mobile ad hoc networks
3,430 Citations2000Sergio Marti, TJ Giuli +2 more
Two techniques that improve throughput in an ad hoc network in the presence of nodes that agree to forward packets but fail to do so are described, using a watchdog that identifies misbehaving nodes and a pathrater that helps routing protocols avoid these nodes.
The Eigentrust algorithm for reputation management in P2P networks
3,353 Citations2003Sepandar Kamvar, Mario Schlösser +1 more
An algorithm to decrease the number of downloads of inauthentic files in a peer-to-peer file-sharing network that assigns each peer a unique global trust value, based on the peer's history of uploads is described.
Incentives Build Robustness in Bit-Torrent
2,661 Citations2003Bram Cohen
The BitTorrent file distribution system uses tit-fortat as a method of seeking pareto efficiency, which achieves a higher level of robustness and resource utilization than any currently known cooperative technique.
First MondayFree riding on Gnutella
1,529 Citations2000Eytan Adar, Bernardo A. Huberman
It is argued that free riding leads to degradation of the system performance and adds vulnerability to the system, and copyright issues might become moot compared to the possible collapse of such systems.
Performance analysis of the CONFIDANT protocol
1,480 Citations2002Sonja Buchegger, Jean‐Yves Le Boudec
It is shown that a network with CONFIDANT and up to 60% of misbehaving nodes behaves almost as well as a benign network, in sharp contrast to a defenseless network.
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
1,220 Citations2001Antony Rowstron, Peter Druschel
The storage management and caching in PAST, a large-scale peer-to-peer persistent storage utility based on a self-organizing, Internet-based overlay network of storage nodes that cooperatively route file queries, store multiple replicas of files, and cache additional copies of popular files, is evaluated.
Peer-to-Peer: Harnessing the Power of Disruptive Technologies
1,058 Citations2001Andy Oram
Managing trust in a peer-2-peer information system
900 Citations2001Karl Aberer, Zoran Despotovic
It is expected that scalable methods for trust management are an important factor, if fully decentralized peer-to-peer systems should become the platform for more serious applications than simple file exchange.
ACM SIGOPS Operating Systems ReviewMeasurement, modeling, and analysis of a peer-to-peer file-sharing workload
821 Citations2003Krishna P. Gummadi, Richard J. Dunn +4 more
ACM SIGOPS Operating Systems ReviewSecure routing for structured peer-to-peer overlay networks
752 Citations2002Miguel Castro, Peter Druschel +3 more
This paper studies attacks aimed at preventing correct message delivery in structured peer-to-peer overlays and presents defenses to these attacks, and describes and evaluates techniques that allow nodes to join the overlay, to maintain routing state, and to forward messages securely in the presence of malicious nodes.
Communications of the ACMPeer-to-peer systems
562 Citations2010Rodrigo Rodrigues, Peter Druschel
Within a decade, P2P has proven to be a technology that enables innovative new services and is used by millions of people every day.
Journal of Economics & Management StrategyThe Social Cost of Cheap Pseudonyms
547 Citations2001Eric J. Friedman, Paul Resnick
Lecture notes in computer scienceTowards a Common API for Structured Peer-to-Peer Overlays
508 Citations2003Frank Dabek, Ben Y. Zhao +3 more
An ongoing effort to define common APIs for structured peer-to-peer overlays and the key abstractions that can be built on them is described to facilitate independent innovation in overlay protocols, services, and applications, to allow direct experimental comparisons, and to encourage application development by third parties.
Incentives for sharing in peer-to-peer networks
460 Citations2001Philippe Golle, Kevin Leyton‐Brown +1 more
This work considers the free-rider problem that arises in peer-to-peer file sharing networks such as Napster: the problem that individual users are provided with no incentive for adding value to the network, by constructing a formal game theoretic model of the system and analyzing equilibria of user strategies under several novel payment mechanisms.
Journal of Economics & Management StrategyThe Social Cost of Cheap Pseudonyms
382 Citations2001Eric J. Friedman, Paul Resnick
Distributed algorithmic mechanism design
362 Citations2002Joan Feigenbaum, Scott Shenker
The basics of DAMD are outlined and the results on multicast cost sharing and interdomain routing are reviewed, and several promising research directions are described.
Secure routing for structured peer-to-peer overlay networks
328 Citations2002Miguel Castro, Peter Druschel +3 more
KARMA : A Secure Economic Framework for Peer-to-Peer Resource Sharing
313 Citations2003Vivek Vishnumurthy, Sangeeth Chandrakumar +1 more
A general economic framework for avoiding freeloaders in peer-to-peer systems that is resistant to malicious attempts by the resource provider, consumer, and a fraction of the members of the bank set.
Lecture notes in computer scienceIncentives for Sharing in Peer-to-Peer Networks
258 Citations2001Philippe Golle, Kevin Leyton‐Brown +2 more
Lecture notes in computer sciencePeer-to-Peer Systems II
246 Citations2003M. Frans Kaashoek, Ion Stoica
Measurement, modeling, and analysis of a peer-to-peer file-sharing workload
230 Citations2003Krishna P. Gummadi, Richard J. Dunn +4 more
Unlike the Web, whose workload is driven by document change, it is demonstrated that clients' fetch-at-most-once behavior, the creation of new objects, and the addition of new clients to the system are the primary forces that drive multimedia workloads such as Kazaa.
Lecture notes in computer scienceRationality and Self-Interest in Peer to Peer Networks
218 Citations2003Jeffrey Shneidman, David C. Parkes
This paper advocates a different model in which peer to peer users are expected to be rational and self-interested, and considers problems that arise when a networking infrastructure contains rational agents.
ACM Transactions on Computer SystemsFast and secure distributed read-only file system
214 Citations2002Kevin Fu, M. Frans Kaashoek +1 more
The self-certifying read- only file system is presented, a content distribution system providing secure, scalable access to public, read-only data, and the overhead of cryptography low on clients, allowing servers to scale to a large number of clients.
Lecture notes in computer scienceEnforcing Fair Sharing of Peer-to-Peer Resources
156 Citations2003Tsuen‐Wan Ngan, Dan S. Wallach +1 more
It is shown how requiring nodes to publish auditable records of their usage can give nodes economic incentives to report their usage truthfully, and simulation results are presented that show the communication overhead of auditing is small and scales well to large networks.
Sustaining cooperation in multi-hop wireless networks
135 Citations2005Ratul Mahajan, Maya Rodrig +2 more
Catch is presented, a protocol that achieves nearly the low mechanism requirements of the routing protocols of the former while imposing nearly as effective barriers to free-riding as the latter.
Exchange-based incentive mechanisms for peer-to-peer file sharing
131 Citations2004Kostas G. Anagnostakis, Michael B. Greenwald
The results show that exchange-based mechanisms can provide strong incentives for sharing, offering significant improvements in service times for sharing users compared to free-riders, without the problems and complexity of cash- or credit-based systems.
Tangler
126 Citations2001Marc Waldman, David Mazières
The design of a censorship-resistant system that employs a unique document storage mechanism that employs a self-policing network of servers designed to eject non-compliant servers and prevent them from doing more harm than good is described.
Security for Structured Peer-to-peer Overlay Networks
122 Citations2004Miguel Castro, Shiping Chen +1 more
Designing incentives for peer-to-peer routing
105 Citations2005Alberto Blanc, Yi-Kai Liu +1 more
This paper model the interactions between nodes as a "random matching game", and describes a simple reputation system that provides incentives for good behavior under certain assumptions, and obtains a stable subgame-perfect equilibrium.
IEEE Transactions on Mobile ComputingNode cooperation in hybrid ad hoc networks
94 Citations2006Naouel Ben Salem, Levente Buttyán +2 more
This paper proposes a charging and rewarding scheme to encourage the most fundamental operation, namely packet forwarding and uses "MAC layering" to reduce the space overhead in the packets and a stream cipher encryption mechanism to provide "implicit" authentication of the nodes involved in the communication.
Samsara
92 Citations2003Landon P. Cox, Brian Noble
Samsara enforces fairness in peer-to-peer storage systems without requiring trusted third parties, symmetric storage relationships, monetary payment, or certified identities.
SLIC: a selfish link-based incentive mechanism for unstructured peer-to-peer networks
92 Citations2004Qi Sun, Héctor García-Molina
A simple selfish link-based incentive (SLIC) mechanism for unstructured P2P file sharing systems to create an incentive structure where in exchange for better service, peers are encouraged to share more data, give more capacity to handle other peers' queries, and establish more connections to improve the P1P overlay network.
SHARP
92 Citations2003Yun Fu, Jeffrey S. Chase +3 more
The results demonstrate the power and practicality of the architecture, the effectiveness of oversubscription for protecting resource availability in the presence of failures, and the use with a decentralized barter economy for global PlanetLab resources.
Incentives-Compatible Peer-to-Peer Multicast
75 Citations2004Tsuen-Wan “Johnny, Ngan Dan S. Wallach +1 more
This paper presents mechanisms that can distinguish nodes with selfish behavior and reduce the quality of service experienced by these selfish nodes from their peers, and requires that the multicast trees be periodically rebuilt.
WIRTSCHAFTSINFORMATIKResource allocation in peer-to-peer networks
37 Citations2003Christian Grothoff
An economic model to perform resource allocation and defend against malicious participants in GNUnet, a peer-to-peer framework for anonymous distributed file-sharing, and takes only local decisions is described.
An Excess-Based Economic Model for Resource Allocation in Peer-to-Peer Networks
37 Citations2005Christian Grothoff
An economic model to perform resource allocation and defend against malicious participants in gnunet, a peer-topeer framework for anonymous distributed file-sharing that aims to provide anonymity for its users is described.