首页 | 本学科首页   官方微博 | 高级检索  
     

一种非结构化P2P网络的资源搜索算法
引用本文:李林校,王芳,郑明春.一种非结构化P2P网络的资源搜索算法[J].信息技术与信息化,2006(1):30-32.
作者姓名:李林校  王芳  郑明春
作者单位:山东师范大学信息管理学院,济南,250014
摘    要:本文针对非结构F2P网络中利用洪泛搜索机制来进行资源搜索的盲目性问题,提出一种利用节点经验积累和cache技术相结合来指导资源搜索的算法。在访搜索算法中,节点记录收到的查询主题和满足该主题的邻居节点,建立主题与邻居节点的对应关系表,当再次收到该主题时,节点就利用该表来指导资源搜索。为了加快搜索速度,将常见查询主题的记录放到cache中。该算法利用一个相似度函数来判断本地文档是否满足查询主题。仿真实验表明,该算法有效地改进了资源搜索的盲目性。减少查询带来的网络流量,提高了查询成功率。

关 键 词:搜索算法  查询  对等网
修稿时间:2005年7月22日

A Resource-searched Algorithm of Unstructured P2P Network
LI Lin-xiao,WANG Fang,ZHENG Ming-chun.A Resource-searched Algorithm of Unstructured P2P Network[J].Information Technology & Informatization,2006(1):30-32.
Authors:LI Lin-xiao  WANG Fang  ZHENG Ming-chun
Affiliation:LI Lin-xiao WANG Fang ZHENG Ming-chun
Abstract:This paper aiming at the blindfold problem of the unstructured peer-to-peer system which makes use of the flooding mechanism to search resource, this paper presents a new resource-searched algorithm of unstructured peer-to-peer system to guide the resource search by using the accumulated node experience and cache technology. In the algorithm, the node record the received query subject and the neighbor nodes fulfilling the subject, and then create a relation table between the subject and neighbor node. When the node receives the subject recorded again, it can guide the resource search by using the table. To speed the search, the records with common query subjects are put in cache. The algorithm uses a resemblance function to determine whether the local document fulfills the query subject. Simulation experiments demonstrate that the algorithm effectively improves the performance of searching resource, reduces the network traffic greatly, and enhances the searching success ratio.
Keywords:P2P
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号