Gnutella环境下基于兴趣和信任的资源发现算法  

A resource discovery algorithm based on interest and trust in gnutella network

作　　者：周金洋[1] 杨寿保[1] 郭磊涛[1] 王菁[1] 

机构地区：[1]中国科学技术大学计算机科学技术系,安徽合肥230026

出　　处：《华中科技大学学报（自然科学版）》2006年第z1期98-100,共3页Journal of Huazhong University of Science and Technology(Natural Science Edition)

基　　金：国家自然科学基金资助项目(60273041);国家高技术研究发展计划资助项目(2002AA104560)

摘　　要：在Gnutella系统中融入兴趣和信任,构建超级节点叠加网络时考虑信任和兴趣的因素,提出一种基于兴趣和信任的资源发现算法,减少资源定位的跳数和系统的网络负载,一定程度上解决恶意节点提供虚假欺诈服务问题,提高系统可用性和服务质量.仿真表明,该算法有效地抑制了欺骗,降低了网络的消息负载,提高了算法的搜索效率.Based on interests and trust,a resource discovery algorithm is proposed for Gnutella.The algorithm combines interests and trusts,together with the considerations of constructing super nodes overlay network.The algorithm can reduce resource locating hops and network loads,relief the problem of falsity services and cheatings to a certain extent,promote system availability and quality of service.Simulations show that the algorithm restrains cheatings effectively,reduces searching messages overhead,and lifts searching efficiency.

关 键 词：GNUTELLA 兴趣 信任 资源发现算法 

分 类 号：TP301.1[自动化与计算机技术—计算机系统结构]