一种基于聚集超级节点的P2P网络信任模型  

A Novel Super-Peer Based Trust Model for Peer-to-Peer Networks

作　　者：田春岐[1,2] 江建慧[1,2] 胡治国[1,2] 李峰[1,2] 

机构地区：[1]同济大学嵌入式系统与服务计算教育部重点实验室,上海201804 [2]同济大学电子与信息工程学院计算机系,上海201804

出　　处：《计算机学报》2010年第2期345-355,共11页Chinese Journal of Computers

基　　金：国家自然科学基金(60903194);教育部博士点基金(200802471060);通信与信息系统北京市重点实验室(北京交通大学)开放课题;国家大学生创新性实践计划及同济大学青年优秀人才培养行动计划资助~~

摘　　要：针对对等网(Peer-to-Peer,P2P)中节点之间由于兴趣爱好差异大、相互发生重复交易的可能性较小从而难以有效建立信任关系的现状,文中提出一种新的基于超级节点的P2P网络信任模型.该模型中节点以兴趣相似而聚簇,节点之间信任关系被划分为3种类型并被给予了各自的解决方案.同时,对于推荐信任信息中存在的虚假的、误导性的和不公正反馈的问题,文中还提出基于节点相似性的反馈信息过滤算法予以有效解决.最后的仿真实验结果表明,该信任模型不但具有抗恶意节点攻击的强壮性,同时在资源查询时具有较低的查询开销和失败率.A super-peer based trust model for Peer-to-Peer （P2P） networks is presented in this paper to solve the problems of not sufficiently building trust relation between peers due to the difference of peers interests and low probability of repeated transactions between them. In the model peers gather in a group according to their interest similarity. Trust relation is categorized into three kinds and subsequently each solution for these kinds is also put forward. Moreover, a feedback filtering algorithm based on peers~ similarity is proposed to effectively filter the fake, misleading and unfair feedbacks in the referrals. Subsequent experimental results show that the proposed model is not only robust on trust security, but also has low costs and failure rate when resource search happens.

关 键 词：对等网 信任 信誉 超级节点 局部信任度 

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