Trustworthiness in peer-to-peer overlay networks

In peer-to-peer (P2P) overlay networks, objects are distributed to peers in various ways like downloading. Service supported by an object is modeled to be a set of methods and quality of service (QoS). In addition to discovering a peer holding a target object, it is critical to discuss what peer is allowed to manipulate the target object in what method. In this paper, we take an acquaintance approach to finding and manipulating objects in P2P overlay networks. An acquaintance peer of a peer p is a peer whose service the peer p knows and with which the peer p can directly communicate. If an access request is issued, a peer has to find where a target object exists, how to obtain an access right on the target object, and how to manipulate the target object. In this paper, we discuss ways to obtain results satisfying an access request by the cooperation of acquaintances. Acquaintance peers of a peer p may hold different information on target peers since it takes time to propagate change information of the target peers and peers may be faulty. Here, it is critical to discuss how much a peer can trust each acquaintance. First, we define how much a requesting peer is satisfied for each access request issued to an acquaintance. Then, we define the trustworthiness of an acquaintance peer based on the satisfiability. That is, a peer considers an acquaintance to be more trustworthy if the acquaintance returns more satisfiable replies

[1]  Tomoya Enokido,et al.  Charge-based flooding algorithm for detecting multimedia objects in peer-to-peer overlay networks , 2005, 19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers).

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

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

[4]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

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

[6]  Matei Ripeanu,et al.  Peer-to-peer architecture case study: Gnutella network , 2001, Proceedings First International Conference on Peer-to-Peer Computing.

[7]  David R. Karger,et al.  Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.

[8]  Li Xiao,et al.  A distributed approach to solving overlay mismatching problem , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[9]  Makoto Takizawa,et al.  Cbf: Look-up Protocol for Distributed Multimedia Objects in Peer-to-peer Overlay Networks , 2005, J. Interconnect. Networks.

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

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

[12]  Ian Clarke,et al.  Freenet: A Distributed Anonymous Information Storage and Retrieval System , 2000, Workshop on Design Issues in Anonymity and Unobservability.