期刊文献+

基于确定性理论的P2P系统信任模型 被引量:6

A Trust Model of P2P System Based on Confirmation Theory
下载PDF
导出
摘要 借鉴确定性理论中的不确定推理,提出了一种新的P2P系统信任模型。该模型根据节点的历史交易情况,运用C-F模型计算节点的可信度,节点依据计算结果与可信度高的节点进行交易,在节点间建立信任关系。分析及仿真表明该模型能有效地隔离恶意节点,提高交易成功率。 This paper presents a novel global trust model based on confirmation theory. The reputation is calculated by C-F model according to the bartering history, and then the peer decides to download the sharing file from which the peer has good reputation. Analyses and simulations show that the model can discard the malicious peer from peer-to-peer system effectively and improve the rate of successful barter greatly.
出处 《电子科技大学学报》 EI CAS CSCD 北大核心 2005年第6期806-808,共3页 Journal of University of Electronic Science and Technology of China
基金 信息产业部电子工业生产发展基金资助项目([2002]1106)
关键词 对等网络 确定性理论 可信度 推荐 peer-to-peer network confirmation theory reputation recommend
  • 相关文献

参考文献8

  • 1Aberer K, Despotovic Z. Managing trust in a peer-2-peer information system[C]. In Ninth International Conference on Information and Knowledge Management (CIKM), Atlanta, 2001. 被引量:1
  • 2Damiani E, Virnercati D, Paraboschi S, et al. A reputation-based approach for choosing reliable resources in peer-to peer networks[C]. In 9th ACM Conference on Computer and Communications Security, Washington DC, 2002. 被引量:1
  • 3Clip2 Company. Gnutella. http://www. clip2.com/gnutella.html, 2004-08-15. 被引量:1
  • 4Cornelli F, Damiani E, Vimercati D, et al. Choosing Reputable Servents in a P2P Network[C]. In Proc. of the 11th Int'l WWW Conference. Honolulu, 2002. 被引量:1
  • 5Lee S, Sherwood R, Bhattacharjee B. Cooperative peer groups in NICE[C]. In IEEE Infocom., San Francisco, 2003. 被引量:1
  • 6Kamvar S D, Schlosser M, Garcia M H, Eigenrep: Reputation management in p2p networks[C]. In Proc. of the 12th Int' 1 WWW Conference, Budapest, 123-134. 被引量:1
  • 7窦文..信任敏感的P2P拓扑构造及其相关技术研究[D].国防科学技术大学,2003:
  • 8王万森编著..人工智能原理及其应用[M].北京:电子工业出版社,2000:291.

同被引文献51

引证文献6

二级引证文献18

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部