Trustworthiness of Peers Based on Access Control in Peer-to-Peer Overlay Networks

  • Authors:

  • Kenichi Watanabe;Yoshio Nakajima;Naohiro Hayashibara;Tomoya Enokido;Makoto Takizawa;S. Misbah Deen

  • Affiliations:

  • Tokyo Denki University, Japan;Tokyo Denki University, Japan;Tokyo Denki University, Japan;Rissho University, Japan;Rissho University, Japan;University of Keele, England

  • Venue:
  • ICDCSW '06 Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Service supported by an object in a peer-to-peer (P2P) overlay network 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 is a peer whose service the peer knows and with which the peer can directly communicate 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 based on the satisfiability.