计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (2): 171-171.

• 网络、通信与安全 • 上一篇    下一篇

P2P网络信任模型的无知证据融合问题研究

张震,王晓明   

  1. 暨南大学计算机科学系
  • 收稿日期:2006-01-25 修回日期:1900-01-01 出版日期:2007-01-11 发布日期:2007-01-11
  • 通讯作者: 张震 machael_zhang machael_zhang

Research on The Problem of Ignorant Evidence Fusion Based on D-S Evidence Theory Trust Model in P2P Network

Zhen Zhang,   

  1. 暨南大学计算机科学系
  • Received:2006-01-25 Revised:1900-01-01 Online:2007-01-11 Published:2007-01-11
  • Contact: Zhen Zhang

摘要: 在完全开放的P2P网络环境中,资源共享是用户的自愿行为,用户不愿为自身的行为负担责任,因而要建立节点之间的信任关系。在已有的基于推荐的信任机制中,基于D-S证据理论方法可以很好的解决了信任的不确定性问题,但是目前在这一领域的研究还没有注意到证据空间呈现大规模无知前提下证据的合理融合问题。针对这一问题,本文对现有的D-S证据理论加以改进,使其符合P2P 网络的安全性要求。

关键词: P2P D-S证据理论 信任机制 无知证据融合

Abstract: For most P2P file-swapping applications, sharing is a volunteer action, and peers are not responsible for their irresponsible bartering history. So it is necessary to establish a trust mechanism for the P2P network. In the existing trust models based recommendation, the Dempster-Shafer(D-S) evidence theory based trust model can solve the uncertain problem. But the existing researches on D-S evidence theory do not aware the problem of reasonable evidence fusion when there are large number of the ignorant evidence in the evidence space. In this paper, we improve the D-S evidence theory to enhance the P2P network security.

Key words: P2P, D-S Evidence Theory, Trust Model, Fusion of Ignorant Evidence.