Trustworthiness of acquaintances in Peer-to-Peer overlay networks

  • Authors:
  • Kenichi Watanabe;Tomoya Enokido;Makoto Takizawa

  • Affiliations:
  • Department of Computers and Systems Engineering, Tokyo Denki University, Ishizaka, Hatoyama, Hiki-gun, Saitama, 350-0394, Japan.;Faculty of Business Administration, Rissho University, 2-16 Osaki 4-Chome, Shinagawa-ku, Tokyo, 141-8602, Japan.;Department of Computers and Information Science, Faculty of Science and Technology, Seikei University, 3-3-1 Kichijoji-kitamachi, Musashino-shi, Tokyo 180-8633, Japan

  • Venue:
  • International Journal of High Performance Computing and Networking
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

Abstract

Various types of applications manipulate objects distributed in Peer-to-Peer 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. We discuss types of acquaintance relations among peers and how much a peer trusts each acquaintance peer. We define the trustworthiness of each acquaintance peer in terms of the acquaintance relations. We discuss a Charge-Based Flooding (CBF) algorithm to find target peers so that more trustworthy areas in Peer-to-Peer overlay networks are more deeply searched. We evaluate the CBF algorithm compared with a TTL-based algorithm.