针对无结构化对等网络中资源搜索效率低、网络带宽消耗高的问题,结合动态搜索算法和缓存技术提出一种使用搜索结果缓存的混合搜索算法(HSUC).该算法按照动态搜索算法进行资源搜索,如果搜索成功,返回资源地址信息,反之,返回搜索失败信息,节点将返回的搜索结果写入缓存作为参考,当其它节点发起相同主题的搜索时,参考该信息进行,不再搜遍整个网络.仿真实验结果表明,该算法改进了资源搜索的盲目性,降低了带宽消耗,提高了搜索成功率.%Aimed at the problems of the low efficiency of resources search and the high consumption of bandwidth in unstructured P2P networks, a hybrid search algorithm using search result caching (HSUC) is proposed, which combines the benefits of dy-namic search (DS) algorithm and caching technique. The algorithm searches for an item according to DS algorithm, the resources address information are returned to originator if the search succeed, whereas returned the failure information. The originator will cache the results for future references. In future stored references can help other peer to search the same item without searching the overall network. Simulation experiments demonstrate that the algorithm effectively improves the performance of searching resource, reduces the bandwidth consumption greatly, and enhances the searching success ratio.
展开▼
