权益分类	功能权益	普通用户	{{item.name}}会员
{{category.name}}	{{benefitItem.name}}

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知道其服务并且对等体p可以在覆盖网络中直接与其通信的对等体。某些熟人对等体可能持有过时的服务信息并且可能是错误的。每个对等体都必须在熟人对等体中找到更值得信赖的对等体。有很多关于如何检测持有目标对象的对等体的讨论。但是，对等体在没有被授予访问权限（许可）的情况下无法操作对象。除了检测WH ...更多信息在peers持有目标对象时，我们必须找到被授予访问权限的peers来操作目标对象。本文用满意度和排序因子定义了每个熟人的可信度。熟人节点的可满足性表明了每个节点通过直接通信不仅可以检测目标对象而且可以获得其访问权限的信任程度。另一方面，不同于传统的信誉概念，熟人节点的排名因子指示熟人节点仅被可信任的熟人节点信任的程度。我们设计了一种新的泛洪类型的检测算法CBF（charge-based flooding）算法，其中包括更值得信赖的节点更深入地搜索区域。在检测算法中，我们评估了熟人节点的可信度是如何通过节点之间的交互而变化的。我们表明，我们可以减少在网络中传输的消息的数量，并增加网络中的目标对象的命中率，即使每个节点的可信度正在发生变化。少