Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Incentives for sharing in peer-to-peer networks
Proceedings of the 3rd ACM conference on Electronic Commerce
A Distributed and Measurement-Based Framework against Free Riding in Peer-to-Peer Networks
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
From Selfish Nodes to Cooperative Networks " Emergent Link-Based Incentives in Peer-to-Peer Networks
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Free Riding on Gnutella Revisited: The Bell Tolls?
IEEE Distributed Systems Online
Incentives to Promote Availability in Peer-to-Peer Anonymity Systems
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
Chord2: A two-layer Chord for reducing maintenance overhead via heterogeneity
Computer Networks: The International Journal of Computer and Telecommunications Networking
Probabilistic file indexing and searching in unstructured peer-to-peer networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
An empirical study of free-riding behavior in the maze p2p file-sharing system
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Cooperating with free riders in unstructured P2P networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
Free riding is a common phenomenon in P2P networks. Although several mechanisms have been proposed to handle free riding-- mostly to exclude free riders, few of them have actually been adopted in practical systems. This may be attributed to the fact that they are nontrivial, and that completely eliminating free riders could jeopardize the sheer power created by the huge volume of participants in a P2P network. Rather than excluding free riders, in this paper we incorporate and utilize them to provide global index service to the files shared by other peers. The simulation results indicate that our model can significantly boost the search efficiency of a plain Gnutella, and the model is quite resistant to system churn rate and the ratio of free riding.