When can an autonomous reputation scheme discourage free-riding in a peer-to-peer system?

Authors:
N. Andrade;M. Mowbray;W. Cirne;F. Brasileiro
Affiliations:
Univ. Fed. de Campina Grande, Brazil;Sch. of Comput. Eng., Nanyang Technol. Univ., Singapore, Singapore;Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel;Dept. of Comput. Sci. & Inf. Syst., Hong Kong Univ., China
Venue:
CCGRID '04 Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid
Year:
2004

Citing 0
Cited 3

Automatic grid assembly by promoting collaboration in peer-to-peer grids

Journal of Parallel and Distributed Computing
Sandboxing for a free-to-join grid with support for secure site-wide storage area

VTDC '06 Proceedings of the 2nd International Workshop on Virtualization Technology in Distributed Computing
Counteracting free riding in Peer-to-Peer networks

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the circumstances under which it is possible to discourage free-riding in a peer-to-peer system for resource-sharing by prioritizing resource allocation to peers with higher reputation. We use a model to predict conditions necessary for any reputation scheme to succeed in discouraging free-riding by this method. We show with simulations that for representative cases, a very simple autonomous reputation scheme works nearly as well at discouraging free-riding as an ideal reputation scheme. Finally, we investigate the expected dynamic behavior of the system.