Jump to content United States-English
HP.com Home Products and Services Support and Drivers Solutions How to Buy
» Contact HP

HP.com home


Technical Reports



» 

HP Labs

» Research
» News and events
» Technical reports
» About HP Labs
» Careers @ HP Labs
» Worldwide sites
» Downloads
Content starts here

 
Click here for full text: PDF

When Can an Autonomous Reputation Scheme Discourage Free-riding in a Peer-to-Peer System?

Mowbray, Miranda; Andrade, Nazareno; Cirne, Walfredo; Brasileiro, Francisco

HPL-2003-264R1

Keyword(s): peer-to-peer; reputation; grid

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, the Network of Favors, works nearly as well at discouraging free-riding as an ideal reputation scheme. Finally, we investigate the expected dynamic behavior of the system when a reputation scheme is used. Notes: Nazareno Andrade, Walfredo Cirne and Francisco Brasileiro, Universidade Federal de Campina Grande, Brazil

8 Pages

Back to Index

»Technical Reports

» 2009
» 2008
» 2007
» 2006
» 2005
» 2004
» 2003
» 2002
» 2001
» 2000
» 1990 - 1999

Heritage Technical Reports

» Compaq & DEC Technical Reports
» Tandem Technical Reports
Printable version
Privacy statement Using this site means you accept its terms Feedback to HP Labs
© 2009 Hewlett-Packard Development Company, L.P.