一种采用瘦服务器的P2P网络关键字搜索算法

Thin-server Using Search Algorithm for Keyword Matches in P2P Systems

P2P技术是未来网络中的关键技术,而搜索算法是决定对等网系统性能的首要因素,本文吸收了现有P2P搜索算法各自的优点,提出了基于瘦服务器的关键字搜索算法,将服务器从巨大的搜索请求响应负担中解脱出来,仅负责搜索树的创立和维护,将搜索任务分散到网络各个节点上去,在充分利用各个节点自身的能力的基础上,又保留了整个网络结构的信息,因此具有结构化对等网系统搜索算法高查全率、低冗余消息以及可扩展性好的优点,也同时保有了非结构化对等网节点平等,结构灵活。

P2P is a key technology in the future network, and the search algorithm is the master factor of determining the performance of the P2P network. This paper based on some existed search algorithm, and described a thin-server based search algorithm, in which the server got rid of the burden of responding the huge number of queries but only took charge of establishing and maintaining the search-trees, and the task to search is distributing to the nodes of the network. The algorithm keeps the information of the topology of the network while the search queries are processed by the nodes, thus brings the high percent success of search recalls, high message efficiency, nodes equality and easy maintenance.