P2P网络资源搜索方法的研究

发布时间：2018-04-24 18:23

本文选题：对等网络 + 资源搜索机制　；参考：《北京交通大学》2015年硕士论文

【摘要】：近年来,P2P网络(Peer-to-Peer,简称P2P)一种分布式网络,对等网络的核心思想是通过系统间节点的直接交互来实现信息资源和服务的共享,它具有大规模、自组织、无中心、可扩展以及高度动态性和异构性的特点,已经被广泛应用到了多个领域。资源搜索机制是P2P网络中的核心研究问题,它主要解决如何在大规模的P2P网络中高效地定位用户所需的资源。由于P2P网络是高度动态的,节点频繁地加入和离开,资源随机分布在P2P网络中的节点中,增加了资源搜索的难度。因此研究P2P网络的资源搜索方法是非常有必要的,以提高搜索的准确度和效率。本文首先分析了P2P网络的特点和资源搜索方法,针对非结构化P2P网络的问题提出了一种基于转发区间的洪泛搜索机制FIFSM (Forwarding Interval based Flooding Search Mechanism)以及改进的FIFSM搜索机制,主要工作为： (1)首先总结了P2P网络的概念、特性、应用领域和研究现状,然后介绍了现有的P2P网络的资源搜索算法。 (2)针对基于洪泛的资源搜索机制引起的问题,本文提出了一种基于转发区间的洪泛搜索机制FIFSM,通过为消息分配不相交的转发区间,使其沿着一棵生成树的结构传播,避免消息环路的产生,从而避免冗余消息的产生。FIFSM机制采用高效的网络维护策略,能够在动态环境下较低开销地保证网络的稳定性。 (3)针对拓扑不匹配问题,本文提出了基于LTM(Location Topology Aware)的FIFSM搜索机制,通过使用LTM方法探测节点之间的距离,调整覆盖网的拓扑结构,使其与底层物理网络拓扑更加匹配。通过利用节点之间的邻近性,优化FIFSM搜索机制的洪泛算法,进一步降低资源搜索延迟。实验结果表明,FIFSM机制能够降低洪泛的开销,避免洪泛引起的网络拥塞,保证资源搜索的高成功率和低延迟,是一种有效的基于洪泛的资源搜索机制。
[Abstract]:In recent years, Peer-to-Peer (P2P) is a distributed network. The core idea of peer-to-peer network is to share information resources and services through the direct interaction of nodes between systems. It has a large scale, self-organization and no center. Extensibility, high dynamic and heterogeneity have been widely used in many fields. Resource search mechanism is the core research problem in P2P networks. It mainly solves the problem of how to efficiently locate the resources required by users in large-scale P2P networks. Since P2P networks are highly dynamic and nodes are joined and left frequently, resources are randomly distributed among nodes in P2P networks, which increases the difficulty of resource search. Therefore, it is necessary to study the resource search method of P2P network in order to improve the accuracy and efficiency of the search. Firstly, this paper analyzes the characteristics of P2P network and resource search methods, and proposes a flooding search mechanism based on forwarding interval (FIFSM forwarding Interval based Flooding Search Mechanism) and an improved FIFSM search mechanism. The main work is as follows: Firstly, the concept, characteristics, application field and research status of P2P network are summarized, and then the resource search algorithms of P2P network are introduced. In order to solve the problems caused by flooding based resource search mechanism, a flooding search mechanism FIFSM based on forwarding interval is proposed in this paper. By assigning disjoint forwarding intervals to messages, the FIFSMs propagate along the structure of a spanning tree. To avoid the generation of message loop and avoid the generation of redundant message. FIFSM mechanism adopts efficient network maintenance strategy which can guarantee the stability of the network with low overhead in dynamic environment. In order to solve the problem of topology mismatch, this paper proposes a FIFSM search mechanism based on LTM(Location Topology Aware. By using LTM method to detect the distance between nodes, the topological structure of overlay network is adjusted to match the topology of the underlying physical network. By using the proximity between nodes to optimize the flooding algorithm of FIFSM search mechanism, the delay of resource search is further reduced. The experimental results show that the FIFSM mechanism can reduce the cost of flooding, avoid the network congestion caused by flooding, and ensure the high success rate and low delay of resource search. It is an effective flooding based resource search mechanism.
【学位授予单位】：北京交通大学
【学位级别】：硕士
【学位授予年份】：2015
【分类号】：TP393.02

【参考文献】