Trustworthiness in Peer-to-Peer (P2P) Systems

点对点 (P2P) 系统中的可信度

基本信息

批准号：
18500064
负责人：
TAKIZAWA Makoto
金额：
$ 2.57万
依托单位：
Tokyo Denki University
依托单位国家：
日本
项目类别：
Grant-in-Aid for Scientific Research (C)
财政年份：
2006
资助国家：
日本
起止时间：
2006 至 2007
项目状态：
已结题

项目摘要

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

大量对等过程分布在对等（P2P）覆盖网络中。很难，由于P2P网络的可扩展性和开放性，因此，同伴可能不可能感知每个资源对象的成员资格和位置。在本文中，我们讨论了一个没有集中控制器的完全分布的P2P系统。每个同行都必须从其收购同行那里获取服务信息，并将其服务信息发送给收购同行。对等P的收购对等是对等方所知道的服务以及对等P可以在覆盖网络中直接通信的对等。一些收购同行可能会持有过时的服务信息，并且可能是错误的。每个同龄人都必须在收购同行中找到一个更值得信赖的人。关于如何检测持有目标对象的同龄人有很多讨论。但是，同伴无法在没有获得访问权利的情况下操纵对象（许可权）。除了检测到WH…更多在同行中，我们还必须找到授予同行操纵目标对象的访问权利。每次获取的可信赖性是根据本文的满意度和排名因素来定义的。收购同行的满意度表明，每个同龄人可以通过直接通信来信任收购对等方面，不仅可以检测目标对象，还可以获得其访问权利。另一方面，收购同行的排名因素表明，仅受到可信赖的收购同行的信任与传统声誉概念不同。我们设计了一种新的洪水类型的检测算法名称CBF（基于电荷的洪水）算法，其中包括更深入的搜索范围更具值得信赖的同行。我们评估了获取同行的可信赖性如何通过检测算法中同行之间的相互作用而改变。我们证明，即使每个对等方的可信度正在改变，我们也可以减少网络中传输的消息的数量，并增加网络中目标对象的命中率。较少的