摘要
资源搜索是P2P应用所面临的最核心问题之一,相关的非结构化P2P系统主要采用查询消息泛洪和信息索引机制。通过对分布非结构化的搜索算法以及对现有改进算法的研究,参考网络中的小世界性给出一种基于兴趣域中心节点的P2P网络拓扑结构。该算法使得节点能在短时间内查找到有效的资源,减少了查询信息量,缩短了路由路径,提高了搜索效率。
One of the essential problems in P2P is the strategy for resource searching.The related methods for unstructured P2P either depend on the flooding or utilize various information indices.The unstructured P2P systems＇ searching algorithm and the relative research are studied.And a P2P network topological based on interest domain with central node is given.When searching,peers can find resource in the shortest time.So the routing distance and searching message are reduced,and the network efficiency is improved.
出处
《科学技术与工程》
2011年第21期5228-5231,共4页
Science Technology and Engineering
关键词
P2P网络
非结构化
兴趣域
中心节点
网络拓扑
peer-to-peer（P2P） network unstructured interest domain central node network topological
