Confidence-based Trustworthiness of Acquaintance Peers in Peer-to-Peer Overlay Networks

In this paper, we discuss a peer-to-peer (P2P) based fully distributed system where each peer process autonomously makes a decision by itself using information obtained from its acquaintance peers without any centralized coordinator. An acquaintance of a peer p is another peer about whose service p knows and with which p can directly communicate. Here, it is critical to discuss how much a peer can trust each acquaintance peer. In this paper, the trustworthiness of an acquaintance peer is defined in terms of the satisfiability and ranking factor with confidence. The trustworthiness depends on how much a peer is satisfied by an acquaintance for each service request and how much each acquaintance peer is trusted by others, i.e. satisfiability and ranking factor of an acquaintance, respectively. In addition, it is significant to discuss how confident a peer is of its own information, satisfiability and ranking factor of an acquaintance. We present a simple auction system as an example in this paper.

[1]  Richard P. Martin,et al.  PlanetP: using gossiping and random replication to support reliable peer-to-peer content search and retrieval , 2002 .

[2]  Hanan Samet,et al.  An efficient nearest neighbor algorithm for P2P settings , 2005, DG.O.

[3]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[4]  Sarvapali D. Ramchurn,et al.  DEVISING A TRUST MODEL FOR MULTI-AGENT INTERACTIONS USING CONFIDENCE AND REPUTATION , 2004, Appl. Artif. Intell..

[5]  27th International Conference on Distributed Computing Systems Workshops (ICDCS 2007 Workshops), June 25-29, 2007, Toronto, Ontario, Canada , 2007, ICDCS Workshops.

[6]  Tomoya Enokido,et al.  Satisfiability and trustworthiness of acquaintances in peer-to-peer overlay networks , 2006, Inf. Syst. Frontiers.

[7]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[8]  Tomoya Enokido,et al.  Trustworthiness of Acquaintances in Peer-to-Peer(P2P) Overlay Networks , 2009, 2010 International Conference on Complex, Intelligent and Software Intensive Systems.

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

[10]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[11]  Ute St. Clair,et al.  Fuzzy Set Theory: Foundations and Applications , 1997 .

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

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

[14]  Makoto Takizawa,et al.  Service Oriented Cooperation among Trustworthy Peers , 2006, J. Interconnect. Networks.

[15]  Daniel W. Manchala.  E-Commerce Trust Metrics and Models , 2000, IEEE Internet Comput..

[16]  Péter Urbán,et al.  Neko: a single environment to simulate and prototype distributed algorithms , 2001, Proceedings 15th International Conference on Information Networking.

[17]  Hector Garcia-Molina,et al.  Routing indices for peer-to-peer systems , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[18]  Butler W. Lampson,et al.  Atomic Transactions , 1980, Advanced Course: Distributed Systems.

[19]  Shanshan Song,et al.  Trusted P2P transactions with fuzzy reputation aggregation , 2005, IEEE Internet Computing.