基于兴趣的Kademlia网络资源搜索算法  

The Network Resources Based on Interest Kademlia Search Algorithm

作　　者：付雯[1] 李响[1] 

机构地区：[1]重庆电子工程职业学院,重庆401331

出　　处：《科技通报》2012年第10期174-175,179,共3页Bulletin of Science and Technology

摘　　要：针对传统的搜索算法效率较低,搜索时间较长的缺陷,提出了一种基于兴趣的Kademlia网络资源搜索算法。通过把兴趣与Kad协议有效地结合在一起,改进后的K桶不再将查询转发向nodeID更接近的节点,而是把查询转发给那些与查询语句的兴趣更相似,更有可能存在所要查询的文件的节点。这样的改进,减少访问与查询无关的节点。实验表明,该算法提高了网络资源搜索的效率,取得了不错的效果。In traditional search algorithm efficiency is low,the search time longer defects,put forward based on the interest Kademlia network resources search algorithm.Through the interest and Kad agreement effective together,the improved K barrel will no longer be queries to nodeID closer to node,but for those with queries query interest more similar,there are more likely to be the nodes of the file query.Such improvements,reduce the access and inquires the node has nothing to do.Experiments show that the algorithm enhances the efficiency of the search network resources,good results.

关 键 词：兴趣区域 网络资源 资源搜索 

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