软件定义网络可靠性研究
发布时间:2018-12-06 19:22
【摘要】:软件定义网络(SDN,Software-definned Networking)是一种新型的网络架构模型,其核心思想是将控制层和数据转发层分离。控制层中的控制器集中式管理数据转发层网络,可以获得全网的拓扑信息。根据全网的拓扑信息,控制器可以提供链路的负载均衡、路径优化、流量分发等应用功能。 当网络规模较小时,一个控制器可以集中式管理全网,控制器获取全网拓扑信息简单直接。但当网络规模较大时,依靠单一控制器已无法满足管理全网的需求,多控制器共同管理全网的方式随之出现。使用多控制器管理全网,每个控制器只集中管理全网的一个子网,即每个控制器只收集它负责管理的子网的信息,并对这个子网的资源性能分配。控制器彼此之间交换自身控制的子网中的网络拓扑信息,以此来获得全网完整的拓扑信息,并在此基础上做出决策。然而,如果其中某个控制器由于故障无法正确获得自身子网中网络拓扑信息,那么,其它控制器都无法从该控制器获得完整的全网拓扑信息,由此导致控制器上各种应用的决策失误。本论文提出了解决这个问题的两个方案,在这两个方案中,控制器独立探测网络中的链路状态,并能定位网络中出现的链路故障的方案。论文的贡献如下: (1)针对已有方案定位多控制器SDN中多链路故障能力弱的问题,本文提出了基于遗传算法的多环生成算法,该算法可以生成多环覆盖网络中所有链路,通过这些多环定位网络中的多链路故障。算法同时对生成的多环的性能进行了优化,使得生成的多环包含的重复链路数尽量少。实验结果表明该方案在探测多链路故障的能力上比现有方案优越。 (2)为了适应网络中出现链路增删的情形,本文提出了基于树分解定位多控制器SDN中链路故障的方案。首先,提出多度无损图分割算法将网络分割成多个独立子网,相较于传统的图分割算法生成的子网,有如下特点:每个子图中的节点具有连通性并且节点的度大于等于2;生成的子图之间既有独立性又具有连通性。其次,提出了最大度-宽度优先树分解算法在子图中生成多环,该算法生成的多环的链路数目的均匀性和总时延较遗传算法生成的多环优越。实验表明,基于树分解定位多控制器SDN中链路故障的方案在需要下发的静态流表项、发送探测信息的个数等指标上比现有方案优越。
[Abstract]:Software defined Network (SDN,Software-definned Networking) is a new network architecture model, whose core idea is to separate the control layer from the data forwarding layer. The controller centralized management of the data forwarding layer network in the control layer can obtain the topology information of the whole network. According to the topology information of the whole network, the controller can provide load balancing, path optimization, traffic distribution and other application functions. When the network scale is small, a controller can manage the whole network centrally, and the controller can obtain the topology information of the whole network simply and directly. However, when the network scale is large, relying on a single controller can no longer meet the needs of the management of the whole network. Using multiple controllers to manage the whole network, each controller manages only one subnet of the whole network, that is, each controller only collects the information of the subnet it is responsible for, and allocates the resource performance of the subnet. The controller exchanges the network topology information of its own control subnet with each other to obtain the complete topology information of the whole network and make the decision on this basis. However, if one of the controllers is unable to obtain the network topology information in its own subnet correctly due to a fault, the other controllers cannot obtain the complete network topology information from the controller. As a result, the decision making of various applications on the controller is wrong. In this paper, two schemes are proposed to solve this problem. In these two schemes, the controller detects the link state in the network independently and can locate the link fault in the network. The contributions of this paper are as follows: (1) aiming at the problem of weak multi-link fault capability in SDN, a multi-loop generation algorithm based on genetic algorithm is proposed in this paper. The algorithm can generate all links in the multi-ring overlay network and locate the multi-link faults in the multi-ring network. The algorithm also optimizes the performance of the generated multi-loop to minimize the number of duplicate links. The experimental results show that the proposed scheme is superior to the existing scheme in detecting multi-link faults. (2) in order to adapt to the condition of link adding and deleting in network, this paper proposes a scheme of link fault location in SDN based on tree decomposition. Firstly, the multi-degree lossless graph segmentation algorithm is proposed to divide the network into several independent subnets. Compared with the subnets generated by the traditional graph segmentation algorithm, it has the following characteristics: the nodes in each subgraph are connected and the degree of the nodes is greater than 2; The generated subgraphs are independent and connected. Secondly, the maximum-width first tree decomposition algorithm is proposed to generate multiple rings in the subgraph. The uniformity of the number of links and the total delay of the links generated by the algorithm are superior to those generated by genetic algorithm. Experimental results show that the scheme based on tree decomposition to locate link faults in multi-controller SDN is superior to the existing scheme in terms of static flow table items that need to be sent down and the number of detection information sent.
【学位授予单位】:北京交通大学
【学位级别】:硕士
【学位授予年份】:2015
【分类号】:TN929.5
本文编号:2366525
[Abstract]:Software defined Network (SDN,Software-definned Networking) is a new network architecture model, whose core idea is to separate the control layer from the data forwarding layer. The controller centralized management of the data forwarding layer network in the control layer can obtain the topology information of the whole network. According to the topology information of the whole network, the controller can provide load balancing, path optimization, traffic distribution and other application functions. When the network scale is small, a controller can manage the whole network centrally, and the controller can obtain the topology information of the whole network simply and directly. However, when the network scale is large, relying on a single controller can no longer meet the needs of the management of the whole network. Using multiple controllers to manage the whole network, each controller manages only one subnet of the whole network, that is, each controller only collects the information of the subnet it is responsible for, and allocates the resource performance of the subnet. The controller exchanges the network topology information of its own control subnet with each other to obtain the complete topology information of the whole network and make the decision on this basis. However, if one of the controllers is unable to obtain the network topology information in its own subnet correctly due to a fault, the other controllers cannot obtain the complete network topology information from the controller. As a result, the decision making of various applications on the controller is wrong. In this paper, two schemes are proposed to solve this problem. In these two schemes, the controller detects the link state in the network independently and can locate the link fault in the network. The contributions of this paper are as follows: (1) aiming at the problem of weak multi-link fault capability in SDN, a multi-loop generation algorithm based on genetic algorithm is proposed in this paper. The algorithm can generate all links in the multi-ring overlay network and locate the multi-link faults in the multi-ring network. The algorithm also optimizes the performance of the generated multi-loop to minimize the number of duplicate links. The experimental results show that the proposed scheme is superior to the existing scheme in detecting multi-link faults. (2) in order to adapt to the condition of link adding and deleting in network, this paper proposes a scheme of link fault location in SDN based on tree decomposition. Firstly, the multi-degree lossless graph segmentation algorithm is proposed to divide the network into several independent subnets. Compared with the subnets generated by the traditional graph segmentation algorithm, it has the following characteristics: the nodes in each subgraph are connected and the degree of the nodes is greater than 2; The generated subgraphs are independent and connected. Secondly, the maximum-width first tree decomposition algorithm is proposed to generate multiple rings in the subgraph. The uniformity of the number of links and the total delay of the links generated by the algorithm are superior to those generated by genetic algorithm. Experimental results show that the scheme based on tree decomposition to locate link faults in multi-controller SDN is superior to the existing scheme in terms of static flow table items that need to be sent down and the number of detection information sent.
【学位授予单位】:北京交通大学
【学位级别】:硕士
【学位授予年份】:2015
【分类号】:TN929.5
【参考文献】
相关期刊论文 前10条
1 侯林;周煜;顾畹仪;;静态p-cycles双链路故障保护配置准则[J];北京邮电大学学报;2006年04期
2 王汝言;常交法;隆克平;张杰;郭芳;;基于圈覆盖的光突发交换网状网故障监测方案[J];北京邮电大学学报;2007年04期
3 唐立新;旅行商问题(TSP)的改进遗传算法[J];东北大学学报;1999年01期
4 毛期俭;颜红;王汝言;吴大鹏;;多域全光网络快速多链路故障定位机制[J];光通信技术;2010年09期
5 韩爱丽;朱大铭;;基于一种新的边权编码方案的中国邮递员问题的DNA计算模型[J];计算机研究与发展;2007年06期
6 李玮;王雷;;中国邮递员问题的DNA计算[J];计算机应用;2009年07期
7 李天龙;吕勇哉;;基于自组织优化算法的一类多旅行商问题[J];计算机应用;2010年02期
8 姚文俊;遗传算法及其研究进展[J];计算机与数字工程;2004年04期
9 郭强;迟洪钦;;基于GA的MTSP问题的研究[J];计算机与数字工程;2010年10期
10 赵国忠;陈靖一;凌韬;;遗传算法求最优路径的设计与实现[J];计算机与数字工程;2010年12期
,本文编号:2366525
本文链接:https://www.wllwen.com/guanlilunwen/ydhl/2366525.html