欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
P2P安全是P2P技术中的关键问题．传统基于信誉度的投票选举方法能够很好地反映P2P网络中未知节点的表现，为该节点的可信度提供可靠依据，但该方法并未将P2P网络中的不确定因素考虑进去．集对分析理论是一种研究不确定性问题的数学方法．本文提出了一种基于节点的不确定性的P2P网络信誉度安全机制，并采用集对分析方法对信誉度进行了定量分析．最后对两种算法做了对比分析，指出了改进算法的优越性．
英文摘要：
The security is a key problem in P2P network. A proposed reputation-polling protocol could resolve it by reflecting the credibility with the former performances of unknown servents. Unfortunately, it didn＇ t take account of the uncertainty in P2P systems. SPA is a new way about dealing with uncertainties problems. We proposed a security solution which was based on servents＇ uncertainties, and took quantitative analysis with SPA for servents＇ reputation. In the end, a comparison was made to testify the solution＇ s superiority.
同期刊论文项目
同项目期刊论文
位置：