Trustworthiness of acquaintances in Peer-to-Peer overlay networks. (27th July 2009)

• Record Type: Journal Article
• Authors: Watanabe, Kenichi; Enokido, Tomoya; Takizawa, Makoto
• Is Part Of: International journal of high performance computing and networking. Volume 6:Number 2(2009)
• Page Start: 160
• Page End: 171
• Publication Date: 2009-07-27
• Subjects: peer-to-peer overlay networks -- P2P -- acquaintance -- trustworthiness -- charge-based flooding algorithm -- QoS -- quality of service -- access control -- satisfiability; High performance computing -- Periodicals; Computer networks -- Periodicals; High performance computing; Periodicals; 004.05
• Languages: English
• ISSNs: 1740-0562

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.