Title: Design and evaluation of algorithms for obtaining objective trustworthiness on acquaintances in P2P overlay networks

Authors: Soichi Sawamura, Admir Barolli, Ailixier Aikebaier, Makoto Takizawa, Tomoya Enokido

Addresses: Department of Computers and Information Science, Faculty of Science and Technology, Seikei University, 3-3-1 Kichijoji-kitamachi, Musashino-shi, Tokyo 180-8633, 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. ' Department of Computers and Information Science, Faculty of Science and Technology, Seikei University, 3-3-1 Kichijoji-kitamachi, Musashino-shi, Tokyo 180-8633, 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. ' Faculty of Business Administration, Rissho University, 4-2-16, Osaki, Shinagawa, Tokyo 141-8602, Japan

Abstract: In fully distributed P2P overlay networks, each peer has to obtain information on objects distributed through communicating with its acquaintances. An acquaintance might hold obsolete information due to the propagation delay and faults of peers. Hence, a peer has to collect information only from trustworthy acquaintances. The subjective trustworthiness shows how much a peer trusts its acquaintance. The objective trustworthiness indicates how much other peers trust the acquaintance. We discuss three algorithms to calculate the objective trustworthiness. The algorithm OT1 shows a type of flooding algorithm. A peer sends request messages only to the acquaintances to reduce the number of messages in the algorithms OT2 and OT3. Furthermore, the peer p_s sends messages to only acquaintances which the peer p_s can trust in OT3. Then, the peer p_s receives the subjective trustworthiness on the acquaintance from the acquaintance p₂. The peer p_u obtains the average value of the subjective trustworthiness collected as the objective trustworthiness. We evaluate the three algorithms in terms of how correct objective trustworthiness can be obtained by the algorithms.

Keywords: P2P overlay networks; trustworthiness; satisfiability; peer-to-peer networks; flooding algorithms; trustworthy acquaintances; P2P networks.

DOI: 10.1504/IJGUC.2011.042042

International Journal of Grid and Utility Computing, 2011 Vol.2 No.3, pp.196 - 203

Published online: 28 Mar 2015 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article