Confidence-based Trustworthiness of Peers in Fully Distributed P2P Overlay Networks

点对点（P2P）系统是由对等进程组成的，本质上是完全分布式的。在这里，讨论每个同伴是否可以信任熟人是至关重要的。由于网络中成员节点上没有集中的协调器，每个节点必须通过与每个熟人的通信来决定每个熟人的可信度。在传统的信誉概念中，对目标同行的每一个可信度意见都是收集的。这里可能包含一些恶意的、过时的观点。在本研究中，我们讨论了一种新颖的方式，即每个同伴只对其可以信任的熟人中的目标同伴采取主观可信度。仿真结果表明，本文所讨论的算法所获得的客观可信度比泛洪算法更准确。此外，同伴对目标同伴的主观可信度可能与客观可信度不同。

A peer-peer (P2P) system is composed of peer processes, which is in nature fully distributed. Here, it is critical to discuss if each peer can trust an acquaintance. Since there is no centralized coordinator on member peers in the networks, each peer has to decide on the trustworthiness of each acquaintance by communicating with the acquaintances. In the traditional reputation concept, every trustworthiness opinion on the target peer is collected. Here, some malicious, obsolete opinions might be included. In this research, we discussed a novel way where each peer only takes a subjective trustworthiness on a target peer from acquaintances which the peer can trust. Through the simulation, we showed the objective trustworthiness obtained by the algorithm we discussed is more accurate than the flooding ones. In addition, a peer might obtain the subjective trustworthiness on a target peer different from the objective one.