无结构P2P网络中一种高效的资源搜索机制  

An Efficient Search Mechanism in Unstructured P2P Network

作　　者：赵佩章[1] 张同光[1] 

机构地区：[1]新乡学院计算机与信息工程学院,新乡453003

出　　处：《电信科学》2012年第3期110-115,共6页Telecommunications Science

基　　金：新乡学院科技创新基金资助项目

摘　　要：在众多P2P资源搜索技术中,基于语义相关的搜索被重点关注。本文在基于语义分组的P2P网络拓扑下,提出了一种新颖高效的搜索方式SKIP(search with K-Iteration preference),即K-层迭代优先选择算法。查询定位到目标节点后,SKIP系统使用K-层迭代优先选择算法进行搜索。实验表明,SKIP算法具有高效的搜索效率和较低的搜索开销,与现有的基于语义的搜索策略相比,具有更高的查准率和更低的查询开销。Among various searching techniques,semantic-based searching has drawn significant attention recently.In this paper,we propose a novel and efficient search mechanism SKIP（search with K-Iteration preference） for P2P networks based on semantic group.In SKIP system,the most relevant part of the target nodes will be preferentially chosen to forward the query and that is called SKIP.Our analysis and simulation results show that the SKIP scheme provides a low overhead on topology maintenance that can be effectively used in P2P searching.Compared with the current semantic-based searching mechanism,we show that the SKIP scheme can outperform in terms of higher precision and lower search cost.

关 键 词：K-层迭代 优先 P2P网络 

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