摘要
针对非结构P2P网络中搜索机制效率低下的问题,提出一种基于兴趣组的高效搜索模型。通过计算节点的相似性,得到兴趣节点,从而建立快捷链接,形成兴趣组。搜索请求首先在兴趣组中传播,提高了搜索效率。实验结果表明该模型对搜索请求具有较高的效率和准确性。
In terms of improving the searching efficiency of unstructured P2P network,a search scheme based on interest group with shortcut search is proposed in this paper.The model finds interest peer by calculating similarity of peer,and gets interest of peer to build shortcut based interest,and forms interest of group.Searching query is sent in interest group first,which can improve the searching performance.Simulation results have shown that the proposed scheme has a relative high efficiency and accuracy.
出处
《计算机工程与应用》
CSCD
北大核心
2007年第31期134-136,168,共4页
Computer Engineering and Applications
基金
国家自然科学基金(the National Natural Science Foundation of China under Grant No.60472044)
河南省信息网络重点实验室开放基金(2006)
关键词
对等网络
兴趣组
搜索
节点
peer-to-peer
interest group
search
peer
