基于多路由配置的IP网络快速恢复机制的研究

发布时间：2018-01-03 13:16

本文关键词：基于多路由配置的IP网络快速恢复机制的研究　出处：《河南科技大学》2017年硕士论文　论文类型：学位论文

【摘要】：视频通话、电子竞技、网上购物等因特网实时业务不断涌现,对网络故障的快速恢复提出了新的挑战。然而,由于传统路由协议存在路由收敛时间长、丢包,甚至环路、拥塞等一系列问题,当网络发生故障时,无法满足实时业务的需求。因此,本文研究IP网络中的故障快速恢复技术。IP网络快速恢复技术通过提前计算备份路由,能快速实现路由收敛。论文以主动式恢复技术为基础,研究了基于多路由配置算法的IP网络故障快速恢复方案。论文的研究内容主要包含以下几个方面:1.针对多路由配置中备份拓扑可用链路较少的问题,提出了一种改进的备份拓扑创建算法。主要是根据备份拓扑中节点的介数值(Betweenness)和紧密度(Closeness)来定义关键节点,以增加关键节点的可用链路,从而减少最短路径跳数,分离共享链路的负载。主要采取两种方法来选取关键节点:一是Top K方法,根据拓扑中节点属性值对其进行降序排序,选择前K个点当作关键点;二是Non-adjacent K方法,在选取关键节点时,考虑关键节点的位置,相邻节点不能同时作为关键节点。实验结果表明,算法在网络中能取得较好的效果,并且能最小化重路由路径总跳数。2.针对使用多路由配置技术进行网络故障恢复后产生的数据流分布不均衡问题,本文建立了一个负载均衡模型。该模型首先创建了一个与链路负载相关的目标函数,而后采用启发式方法求出一系列达到最优解的权重值,对每条链路赋予合适的权重来分布数据流。由实验结果能得出,加入负载均衡模型的算法能够通过降低高负载链路的使用概率来呈现更好的数据流分布。
[Abstract]:Internet real-time services, such as video calls, e-sports, online shopping, etc, are emerging, which poses a new challenge to the rapid recovery of network failures. However, due to the long time of routing convergence and packet loss in traditional routing protocols. Even loop, congestion and other problems, when the network failure, can not meet the needs of real-time services. This paper studies the fast recovery technology in IP network. The fast recovery technology of IP network can quickly realize routing convergence by calculating backup route in advance. This paper is based on active recovery technology. This paper studies the fast recovery scheme of IP network fault based on multi-route configuration algorithm. The research content of this paper mainly includes the following aspects: 1.To solve the problem of few links available for backup topology in multi-routing configuration. An improved algorithm for the creation of backup topology is proposed, which defines the key nodes according to the intermediate values of nodes in the backup topology (Betweeness) and closeness). In order to increase the available links of key nodes, reduce the number of shortest path hops and separate the load of shared links, two methods are adopted to select the key nodes: one is the Top K method. According to the node attribute value in topology, it is sorted in descending order, and the first K points are selected as the key points. The second is the Non-adjacent K method. When the key nodes are selected, the location of the key nodes is considered, and the adjacent nodes cannot be regarded as the key nodes at the same time. The experimental results show that. The algorithm can achieve good results in the network, and can minimize the total number of hops of the rerouting path. 2. Aiming at the problem of uneven data flow distribution caused by the multi-route configuration technology for network fault recovery. In this paper, a load balancing model is established, which first creates an objective function related to link load, and then uses heuristic method to obtain a series of weights to achieve the optimal solution. According to the experimental results, it can be concluded that the algorithm with load balancing model can provide better data flow distribution by reducing the usage probability of high-load links.
【学位授予单位】：河南科技大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：TP393.0

【相似文献】