By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)

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.

Published in:

Distributed Computing Systems Workshops, 2006. ICDCS Workshops 2006. 26th IEEE International Conference on

Date of Conference:

04-07 July 2006