loading...
When can an autonomous reputation scheme discourage free-riding in a peer-to-peer system?
Chicago, IL, USA April 19-April 22
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CCGrid.2004.1336599Fourth IEEE International Symposium o ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
N. Andrade, Univ. Fed. de Campina Grande, Brazil
M. Mowbray, Sch. of Comput. Eng., Nanyang Technol. Univ., Singapore, Singapore
W. Cirne, Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
F. Brasileiro, Dept. of Comput. Sci. & Inf. Syst., Hong Kong Univ., China
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.
Citation:
N. Andrade, M. Mowbray, W. Cirne, F. Brasileiro, "When can an autonomous reputation scheme discourage free-riding in a peer-to-peer system?," ccgrid, pp.440-448, Fourth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.