The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
Trust Based Incentive in P2P Network
CEC-EAST '04 Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference
Free Riding on Gnutella Revisited: The Bell Tolls?
IEEE Distributed Systems Online
Incentives in BitTorrent induce free riding
Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems
Clustering and sharing incentives in BitTorrent systems
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Efficient simulation of large-scale p2p networks: packet-level vs. flow-level simulations
Proceedings of the second workshop on Use of P2P, GRID and agents for the development of content networks
Trust-aware Adaptive P2P Overlay Topology Based on Superpeer-partition
GCC '07 Proceedings of the Sixth International Conference on Grid and Cooperative Computing
A 3-Tier Hierarchical Peer-to-Peer System with Fair Incentive Scheme to Avoid Free Riders
ADCOM '07 Proceedings of the 15th International Conference on Advanced Computing and Communications
Ecological Network-Inspired Trust Management Model of P2P Networks
DMAMH '07 Proceedings of the Second Workshop on Digital Media and its Application in Museum & Heritage
| Hi-index | 0.00 |
P2P networks have become popular, and face the problem of peers who consume more than their fair share of the network's resources; so called free-riders. The solution to this problem primarily involves correctly identifying the free-riders, determining appropriate measures for discouraging and/or penalizing them; and possibly rewarding non free-riders for good behavior. In this paper therefore, we discuss current approaches for addressing the free-rider problem in P2P networks and offer some workable solutions.