Probabilistic prediction of peers' performance in P2P networks

The problem of encouraging trustworthy behavior in P2P online communities by managing peers' reputations has drawn a lot of attention recently. However, most of the proposed solutions exhibit the following two problems: huge implementation overhead and unclear trust related model semantics. This paper shows that a simple probabilistic technique, maximum likelihood estimation namely, can reduce these two problems substantially when employed as the feedback aggregation strategy. We evaluate the technique in three settings relevant for applications of P2P networks and show that it performs well in all of them. Thus, no complex exploration of the feedback is necessary. Instead, simple, intuitive and efficient probabilistic estimation methods suffice.

[1]  David M. Kreps,et al.  Reputation and imperfect information , 1982 .

[2]  M. Melnik,et al.  Does a Seller's Ecommerce Reputation Matter? Evidence from Ebay Auctions , 2003 .

[3]  Jean-Yves Le Boudec,et al.  The Effect of Rumor Spreading in Reputation Systems for Mobile Ad-hoc Networks , 2003 .

[4]  Karl Aberer,et al.  Managing trust in a peer-2-peer information system , 2001, CIKM '01.

[5]  W. Hamilton,et al.  The evolution of cooperation. , 1984, Science.

[6]  Paul Resnick,et al.  Trust among strangers in internet transactions: Empirical analysis of eBay' s reputation system , 2002, The Economics of the Internet and E-commerce.

[7]  Lik Mui,et al.  A Computational Model of Trust and Reputation for E-businesses , 2002 .

[8]  Matthew Richardson,et al.  Trust Management for the Semantic Web , 2003, SEMWEB.

[9]  Hector Garcia-Molina,et al.  The Eigentrust algorithm for reputation management in P2P networks , 2003, WWW '03.

[10]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[11]  Ling Liu,et al.  PeerTrust: supporting reputation-based trust for peer-to-peer electronic communities , 2004, IEEE Transactions on Knowledge and Data Engineering.

[12]  Chrysanthos Dellarocas Efficiency and Robustness of Binary Feedback Mechanisms in Trading Environments with Moral Hazard , 2003 .

[13]  Hector Garcia-Molina,et al.  EigenRep: Reputation Management in P2P Networks , 2003 .

[14]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[15]  L. Mui,et al.  A computational model of trust and reputation , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[16]  Ion Stoica,et al.  Incentives for Cooperation in Peer-to-Peer Networks , 2003 .

[17]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[18]  Chrysanthos Dellarocas,et al.  The Digitization of Word-of-Mouth: Promise and Challenges of Online Feedback Mechanisms , 2003, Manag. Sci..

[19]  Karl Aberer,et al.  P-Grid: A Self-Organizing Access Structure for P2P Information Systems , 2001, CoopIS.

[20]  Thomas Beth,et al.  Valuation of Trust in Open Networks , 1994, ESORICS.

[21]  D. Fudenberg,et al.  Reputation and Equilibrium Selection in Games with a Patient Player , 1989 .

[22]  Paul Resnick,et al.  Reputation systems , 2000, CACM.

[23]  Sandip Sen,et al.  Robustness of reputation-based trust: boolean case , 2002, AAMAS '02.