Incentives for Sharing in Peer-to-Peer Networks
WELCOM '01 Proceedings of the Second International Workshop on Electronic Commerce
A Game Theoretic Framework for Incentives in P2P Systems
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
Robust incentive techniques for peer-to-peer networks
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Modeling and performance analysis of BitTorrent-like peer-to-peer networks
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Enforcing efficient resource provisioning in peer-to-peer file sharing systems
ACM SIGOPS Operating Systems Review
The impact of incentive mechanisms in multi-channel mobile music distribution
Multimedia Tools and Applications
Self-organised virtual communities: bridging the gap between web-based communities and P2P systems
International Journal of Web Based Communities
A modeling framework of content pollution in Peer-to-Peer video streaming systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Coordination of cooperation policies in a peer-to-peer system using swarm-based RL
Journal of Network and Computer Applications
Invited talk II summary: incentive schemes in memory-less P2P systems
WAC'05 Proceedings of the Second international IFIP conference on Autonomic Communication
Hi-index | 0.00 |
In this paper we address the issue of content availability in p2p file sharing systems. Content availability is a public good: the copying of a file by one peer does not prevent another peer also from copying it; but contributing files to the common pool is costly. The asymptotic analysis of certain public good models for p2p file sharing suggests that when the aim is to maximize social welfare, a fixed contribution scheme in terms of the number of files shared per unity of time can be asymptotically optimal as the number of participants n grows to infinity. However, the enforcement of such an incentive scheme is not straightforward in a realistic p2p system, where no trusted software or central entity accounting for peers' transactions can be assumed and peers are free to change their identity with no cost. We present a realistic version of the fixed contribution scheme, which does not require the use of system memory but relies only on the time peers are consuming resources to ensure that they contribute adequately. We describe the functionality that should be supported for enforcement and discuss the additional incentive issues that arise in this context, proposing some practical solutions to address them. We also formulate a suitable economic model to estimate the efficiency-loss of the proposed mechanism (compared to the one achieved using the theoretically optimal schemes under complete and incomplete information) and provide some insights for the correct tuning of its basic parameters. Our first results indicate that the proposed mechanism constitutes a good compromise between economic efficiency and implementability and should lead to some interesting and practical solutions for providing incentives for content availability in p2p systems.