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

全分布式 P2P 覆盖网络中基于置信度的节点可信度

• 批准号: 20500078
• 负责人: TAKIZAWA Makoto
• 金额: $ 2.91万
• 依托单位: Seikei University
• 依托单位国家: 日本
• 项目类别: Grant-in-Aid for Scientific Research (C)
• 财政年份: 2008
• 资助国家: 日本
• 起止时间: 2008 至 2010
• 项目状态: 已结题
• 来源: https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-20500078/
• 关键词: P2Pオーバレイ; ネットワーク; 信用可能性; 自信度; アクセス制御; 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.

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

项目成果

A Scalable Peer-to-Peer Group Communication Protocol

可扩展的点对点组通信协议

• 发表时间: 2010
• 作者: I.Tsuneizumi;A.Aikebaier;T.Enokido;M.Takizawa
• 通讯作者: M.Takizawa

Power Consumption-based Server Selection Algorithms for Communication-based Systems

基于通信系统的基于功耗的服务器选择算法

• 发表时间: 2010
• 作者: T.Enokido;A.Aikebaier;S.M.Deen;M.Takizawa
• 通讯作者: M.Takizawa

Trustworthiness of Acquaintances in Peer-to-Peer Overlay Networks

对等覆盖网络中熟人的可信度

• 发表时间: 2006
• 期刊: International Journal of High Performance Computing and Networking (IJHPCN)
• 作者: Watanabe K.;Enokido;T.;Takizawa;M.
• 通讯作者: M.

Heterogeneous Clock Group Protocol for Causally Ordered Delivery of Messages

用于按因果顺序传递消息的异构时钟组协议

• 发表时间: 2005
• 期刊: International Journal of Wireless and Mobile Computing (IJWMC)
• 作者: Kawanami;S.;Enokido;T.;Takizawa;M.
• 通讯作者: M.

A Legal Information Flow (LIF) Scheduler Based on Role-based Access Control Model

基于角色访问控制模型的法律信息流(LIF)调度器

• 发表时间: 2009
• 期刊: International Journal of Computer Standard and Interfaces Vol.31, No.5
• 作者: T.Enokido;M.Takizawa
• 通讯作者: M.Takizawa