By Topic

Confidence-based Trustworthiness of Acquaintance Peers 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

5 Author(s)

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.

Published in:

Distributed Computing Systems Workshops, 2007. ICDCSW '07. 27th International Conference on

Date of Conference:

22-29 June 2007