节点文献

非结构化P2P网络搜索算法研究

Research on Search Algorithm of Unstructured P2P Network

【作者】 李薇

【导师】 姚全珠;

【作者基本信息】 西安理工大学 , 计算机应用技术, 2010, 硕士

【摘要】 对等(P2P)计算是未来网络中的关键技术,对等网络是实现下一代互联网的重要组成部分。如何高效地搜索P2P网络上的资源是P2P网络实现的最为关键的问题。非结构化P2P网络的高动态、自组织、高扩展等特点,使得非结构化P2P网络迅速流行起来。由于非结构化P2P网络中的节点缺乏全局网络的拓扑知识,如何定位节点资源、减少网络节点之间的搜索通信开销成为P2P网络搜索的核心问题。针对这一核心问题,本文主要工作及创新点在于:1、针对各种基于流言机制的通信协议在构造非结构化P2P覆盖网络中,其适用范围缺乏广泛地实证的问题,给出了一个通用的协议框架--基于流言机制的节点采样服务,以执行高效和可靠的节点采样服务。在这种协议框架下通过实验分析了八种通信协议的差异。总结出(rand,rand,push)和(tail,rand,push)两种通信协议所构造的非结构化P2P覆盖网络具有小世界特性。2、遵循从社会学、组织学得到的启示并依据复杂网络理论,紧紧抓住对等网络具有小世界特性这一理论基础,在非结构化P2P覆盖网络构造研究的成果基础之上,将拓扑结构优化和信息性搜索(informed search)技术相结合,提出了一种基于兴趣相关度和小世界的搜索算法。引入了基于节点兴趣相关度的查询算法和转发查询算法,当节点在转发查询消息时优先转发给兴趣相关度高的邻居节点,从而保证消息转发的高效性,避免了消息转发的盲目性,减少了搜索通信开销并获得了更高的查询检索效率。通过实验验证了算法的有效性。

【Abstract】 Peer-to-Peer (P2P) computing is the critical technology for the future network, such as the network is to achieve an important component of next generation Internet. How to efficiently search resources on the P2P which is the most critical issue. Unstructured P2P networks, high dynamic, self-organization, scalability and other features, makes the unstructured P2P networks more and more popular. Unstructured P2P networks have the lack of global network nodes in the knowledge of the topology, how to locate the node resources, reduce network communication overhead between the nodes of the search to become the core issue of P2P search.In response to this core issue, this paper work and innovation are as follows:1、Gossip-based communication protocols have been applied in construct unstructured P2P overlay network, but their scopes of application have the lack of extensive empirical analysis. This paper presents a generic framework--gossip-based peer sampling service to implement a reliable and efficient sampling service. Under the framework to explore and compare eight communication Protocol.Show that (rand, rand, push) and (tail, rand, push) two kinds of communication protocol structure unstructured P2P overlay network with small world properties.2、Follows from a sociological, inspiration of histological and based on complex network theory, the peer-to-peer networks have small world characteristics, in the results of research on constructed the unstructured P2P overlay network, combine topological structural optimization and information search, paper presents a search algorithm based on interests correlation and the small world introduce query algorithm and forwarding query algorithm based on interests correlation. When the node forwards query messages priority forwarded to the high interests correlation neighbor node, in order to ensure the message forwarding efficiency, to avoid the blindness of forwarding the message and reduce communication overhead in the search query for getting a higher retrieval efficiency. Experiments show the effectiveness of the algorithm.

节点文献中: