Trustworthiness in Peer-to-Peer (P2P) Systems

大量对等进程分布在对等(P2P)覆盖网络中。由于P2P网络的可伸缩性和开放性，对等点很难、甚至不可能感知每个资源对象的成员资格和位置。在这篇文章中，我们讨论了一个没有集中控制器的全分布式P2P系统。每个对等点必须从其熟人对等点获得服务信息，并且还将其服务信息发送给熟人对等点。对等体P的熟人对等体是对等体P知道其服务并且对等体P可以在覆盖网络中与其直接通信的对等体。某些熟人对等体可能持有过时服务信息且可能有故障。每个对等点都必须在熟人对等点中找到更值得信任的对等点。有很多关于如何检测持有目标对象的对等体的讨论。但是，在未被授予访问权限(权限)的情况下，对等方不能操作对象。除了检测WH…之外更多地，在持有目标对象的对等点，我们必须找到被授予访问权限以操纵目标对象的对等点。本文从可满足性和排序因子两个方面定义了熟人的信任度。熟人节点的可满足性表示了每个节点通过直接通信对熟人节点的信任程度，不仅可以检测目标对象，还可以获得其访问权限。另一方面，熟人节点的排名因子表示熟人节点只被可信熟人节点信任的程度，这与传统的声誉概念不同。我们设计了一种新的洪泛型检测算法CBF(Charge-Based Flowing)算法，该算法对包含更多可信节点的区域进行更深入的搜索。在检测算法中，我们通过节点之间的交互来评估熟人节点的可信度是如何变化的。我们表明，即使每个节点的可信性发生变化，我们也可以减少网络中传输的消息数量，提高目标对象在网络中的命中率。较少

A large number of peer processes are distributed in a peer-to-peer (P2P) overlay network. It is difficult, may be impossible for a peer to perceive the membership and location of every resource object due to the scalability and openness of a P2P network. In this paper, we discuss a fully distributed P2P system where there is no centralized controller. Each peer has to obtain service information from its acquaintance peers and also sends its service information to the acquaintance peers. An acquaintance peer of a peer p is a peer about whose service the peer p knows and with which the peer p can directly communicate in an overlay network. Some acquaintance peer might hold obsolete service information and might be faulty. Each peer has to find a more trustworthy one in acquaintance peers. There are many discussions on how to detect peers which hold a target object. However, a peer cannot manipulate an object without being granted access rights (permissions) . In addition to detecting wh … More at peers hold a target object, we have to find peers granted access rights to manipulate the target object. The trustworthiness of each acquaintance is defined in terms of the satisfiability and ranking factor in this paper. The satisfiability of an acquaintance peer shows how much each peer can trust the acquaintance peer through direct communication to not only detect target objects but also obtain their access rights. On the other hand, the ranking factor of an acquaintance peer indicates how much the acquaintance peer is trusted only by trustworthy acquaintance peers differently from the traditional reputation concept. We designed a new flooding type of detection algorithm names CBF (charge-based flooding) algorithm where areas including the more trustworthy peers are the more deeply searched. We evaluate how the trustworthiness of acquaintance peer is changing through interactions among peers in the detection algorithm. We showed that we can reduce the number of messages transmitted in the network and increase the hit ratio of a target object in the network even if the trustworthiness of each peer is changing. Less