不同证据合成规则下的P2P信任模型比较  

A Comparative Study of the Trust Model for P2P System under Different Evidence Combination Rules

作　　者：黄立冬[1,2] 冯燕彬[1] 赵艳芳[1] 薛岗[2] 

机构地区：[1]云南民族大学数学与计算机科学学院,云南昆明650031 [2]云南大学智能计算网络实验室,云南昆明650031

出　　处：《云南民族大学学报（自然科学版）》2010年第5期317-320,共4页Journal of Yunnan Minzu University:Natural Sciences Edition

基　　金：国家自然科学基金(60763008)

摘　　要：将D-S证据理论运用到P2P系统的全局信任模型中逐渐成为人们关注的焦点.然而,D-S证据理论作为信息融合的一种有效工具,其合成规则存在着一定的局限性.比较和分析了各种证据合成规则,并将这些证据合成规则应用到同一信任模型上,仿真和分析表明不同合成规则下的同一信任模型的成功交易率差异较大.There is growing concern about which D -S evidence theory should be applied to the global trust model for P2P systems. However, as an effective tool for information fusion, the combination rules of D -S evidence theory have some limitations. This paper compares and analyzes a variety of evidence combination rules which are applied to the same trust model. The simulation and analysis show that the successful transaction rate of the same trust model varies with different combination rules.

关 键 词：P2P网络 D—S证据理论 合成规则 可信度 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]