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
• 项目状态: 已结题
• 来源: https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-18500064/
• 关键词: Distributed systems; P2P Systems; Acquaintance peer; Trustworthiness; Access control; Confidence; Reputation; ランキング因子; CBFアルゴリズム

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 知道并可以在覆盖网络中直接通信。一些熟人可能持有过时的服务信息，并且可能存在故障。每个对等点都必须在熟人中找到一个更值得信赖的服务。检测持有目标对象的对等体。但是，如果没有授予对等体访问权限（权限），则除了检测对等体持有目标对象外，我们还必须找到被授予操作访问权限的对等体。目标对象。在本文中，每个熟人都是根据可满足性和排名因子来定义的。熟人对等体的可满足性表明每个对等体可以通过直接通信来信任熟人对等体，从而不仅可以检测到目标对象，还可以获取其访问权限。另一方面，熟人节点的排名因子表明熟人节点仅被可信赖的熟人节点信任的程度，与传统的声誉概念不同，我们设计了一种新的泛洪类型检测算法，称为CBF（基于费用的泛洪）算法。包括越值得信赖的同行越深入我们通过检测算法中的同伴之间的交互来评估熟人同伴的可信度如何变化。每个同行的可信度正在发生变化。

项目成果

Ranking Factors in Peerto・Peer Overlay Networks

Peerto・Peer Overlay 网络中的排名因素

• 发表时间: 2007
• 期刊: ACM Transaction on Autonomous and Adaptive Systems(TAAS) 2
• 作者: Watanabe;K.;Nakajima;Y.;Enokido;T.;Takizawa;M.
• 通讯作者: M.

Distributed Coordination Protocols to Realize Scalable Multimedia Streaming in Peer-to-peer (P2P) Overlay Networks

用于在点对点 (P2P) 覆盖网络中实现可扩展多媒体流的分布式协调协议

• 发表时间: 2006
• 期刊: Journal of Mobile Multimedia (JMM) Vol. 2, No. 4
• 作者: Enokido;T.;Tanaka;Y.;Itaya;M.;Takizawa;M
• 通讯作者: M

A Mobile Agent Model for Fault-Tolerant Manipulation on Distributed Obects

分布式对象容错操作的移动代理模型

• 发表时间: 2007
• 期刊: International Journal of Cluster Computing (MCC) Vol. 10, No. 1
• 作者: Tanaka;Y.;Hayashibara;N.;Enokido;T.;Takizawa;M
• 通讯作者: M

Distributed Multi-Source Streaming Models in Peer-to-Peer Overlay Networks

对等覆盖网络中的分布式多源流模型

• 发表时间: 2007
• 期刊: Journal of Simulation Modelling Practice and Theory 15
• 作者: Enokido;T.;Tanaka;Y.;Barolli;V.;Takizawa;M.
• 通讯作者: M.

A Superpeer-Based Two-Layer P2P Overlay Network with the CBF Strategy

• DOI: 10.1109/cisis.2007.8
• 发表时间: 2007-04
• 期刊: First International Conference on Complex, Intelligent and Software Intensive Systems (CISIS'07)
• 作者: Kenichi Watanabe;Naohiro Hayashibara;M. Takizawa