• Corpus ID: 15224726

KARMA : A Secure Economic Framework for Peer-to-Peer Resource Sharing

@inproceedings{Vishnumurthy2003KARMAA,
  title={KARMA : A Secure Economic Framework for Peer-to-Peer Resource Sharing},
  author={Vivek Vishnumurthy and Sangeeth Chandrakumar and Emin G{\"u}n Sirer},
  year={2003}
}
Peer-to-peer systems are typically designed around the assumption that all peers will willingly contribute resources to a global pool. They thus suffer from freeloaders, that is, participants who consume many more resources than they contribute. In this paper, we propose a general economic framework for avoiding freeloaders in peer-to-peer systems. Our system works by keeping track of the resource consumption and resource contribution of each participant. The overall standing of each… 

Figures from this paper

BarterCast : Fully Distributed Sharing-Ratio Enforcement in BitTorrent
TLDR
This paper presents a secure, fully distributed mechanism for reputation management and its integration with BitTorrent, which enforces a long-term balanced sharing-ratio for all peers in a BitTor- rent file sharing network.
PeerMint: Decentralized and Secure Accounting for Peer-to-Peer Applications
TLDR
PeerMint is a completely decentralized and secure accounting scheme which facilitates market-based management of P2P applications and has been implemented as part of a modular Accounting and Charging system to show PeerMint's practical applicability.
Incentive mechanisms in peer-to-peer networks
TLDR
This work develops incentive mechanisms, which enable the correct operation of peer-to-peer systems, imposing a balance between demand for resources and the existing offer, so that they do not pose an unnecessary burden, slowing down the system excessively.
Economic Modelling and Incentive Mechanisms for Ecient Resource Provision in Peer-to-Peer Systems
TLDR
This dissertation focuses on the issue of content provision in p2p file sharing systems as the main case study and model content provision as a problem of private provision of a public good in this classic, and very challenging, problem in the economics literature.
Trusted accounting in peer-to-peer environments: a novel token-based accounting scheme for autonomous distributed systems
TLDR
This dissertation researches the feasibility of fully distributed, trusted accounting in p2p systems with intrinsic automatic cooperation control by presenting and evaluating the token-based accounting scheme, and demonstrates the viability and efficiency of the novel token- based accounting scheme.
Incentives and fair sharing in peer-to-peer systems
TLDR
This thesis presents mechanisms to enforce fair sharing of limiting resources in peer-to-peer systems using an economic analysis of utility functions and shows how the overcapacity parameter should be set and why clustering of the system would benefit users.
Robust Accounting in Decentralized P2P Storage Systems
TLDR
This work describes a robust distributed system to account for the storage activities of each peer, and proves that it is secure under a much stronger attack model than previous work, and evaluates the efficiency of a prototype implementation.
A survey of peer-to-peer content distribution technologies
TLDR
This survey proposes a framework for analyzing peer-to-peer content distribution technologies and focuses on nonfunctional characteristics such as security, scalability, performance, fairness, and resource management potential, and examines the way in which these characteristics are reflected in and affected by the architectural design decisions adopted by current peer- to-peer systems.
A SURVEY OF PEER-TO-PEER MICROPAYMENT SCHEMES
TLDR
The requirements that need to be kept in mind while designing micropayment schemes are listed, a survey of existing schemes is presented, and a comparison of the schemes with respect to security and performance is given.
Protocols for sharing computing resources and dealing with nodes' selfishness in peer-to-peer networks
TLDR
A solution for enabling distributed computing by harnessing idle computing resources in P2P networks taking into account nodes' selfishness is provided and a reputation management framework for allowing users to evaluate the trustworthiness of each other before trading services/resources among themselves is proposed.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 15 REFERENCES
Measurement study of peer-to-peer file sharing systems
TLDR
This measurement study seeks to precisely characterize the population of end-user hosts that participate in Napster and Gnutella, and shows that there is significant heterogeneity and lack of cooperation across peers participating in these systems.
Enforcing Fair Sharing of Peer-to-Peer Resources
TLDR
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.
Secure routing for structured peer-to-peer overlay networks
TLDR
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.
Rationality and Self-Interest in Peer to Peer Networks
TLDR
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.
The Sybil Attack
TLDR
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.
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
TLDR
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.
Pastry: Scalable, distributed object location and routing for large-scale peer-to-
TLDR
Experimental results obtained with a prototype implementa tion on a simulated network of up to 100,000 nodes confirm Pastry’s scalability, its ability to selfconfigure and adapt to node failures, and its good network loc ality properties.
Herbivore: A Scalable and Efficient Protocol for Anonymous Communication
TLDR
Herbivore is described, a peer-to-peer, scalable, tamper-resilient communication system that provides provable anonymity and privacy and simultaneously provides high efficiency and scalability, distinguishing it from other anonymous communication protocols.
Economic models for allocating resources in computer systems
TLDR
A macroscopic view of distributed computer systems reveals the complexity of the resources and services they provide and the satisfaction of users and the performance of applications is determined by the simultaneous allocation of multiple resources.
Free Riding on Gnutella
TLDR
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.
...
1
2
...