SDN网络中高效流量分配方法研究

发布时间：2018-04-04 17:36

本文选题：SDN　切入点：路径规划　出处：《浙江大学》2017年硕士论文

【摘要】：软件定义网络(Software Defined Network,SDN)将网络设备上的控制权分离,并交由集中控制器管理,屏蔽了来自底层网络设备的差异,用户可以更加灵活的自定义网路路由和传输规则。合理地分配网络上的流量,和智能地规划网络传输路径,是SDN网络控制器最基本的功能。本文针对流量分配和路径规划问题,提出了基于LKH算法和网络流模型的解决方案,其具体工作如下:(1)将SDK路径规划问题建模成TSP问题,并根据LKH算法进行路径初始求解,进而不断优化和修正待规划的路径;(2)针对LKH算法在某些特殊数据上求解慢的问题,改进了有上下界的网络流模型,通过拆分约束点,破环和推流等方法,以提供更好的解。总的来说,本文研究的是SDN网络中的流量分配和路径规划问题。通过改进LKH算法和网络流模型,我们提出了一个新的路径规划方法。实验表明,新提出的方法在实际的数据上取得了不错的实验效果。
[Abstract]:Software Defined Network (SDN) separates the control rights on the network devices and is managed by a centralized controller, which shields the differences from the underlying network devices and allows users to customize the network routing and transmission rules more flexibly.It is the basic function of SDN network controller to distribute the network traffic reasonably and plan the network transmission path intelligently.In this paper, a solution based on LKH algorithm and network flow model is proposed for traffic allocation and path planning. The specific work is as follows: 1) the SDK path planning problem is modeled as a TSP problem, and the initial solution is based on the LKH algorithm.Then the path to be planned is continuously optimized and modified. Aiming at the slow problem solved by LKH algorithm on some special data, the network flow model with upper and lower bound is improved, and the better solution is provided by splitting the constraint points, breaking the loop and pushing the flow.In general, traffic allocation and path planning in SDN networks are studied in this paper.By improving the LKH algorithm and the network flow model, we propose a new path planning method.The experimental results show that the new method has achieved good experimental results on the actual data.
【学位授予单位】：浙江大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：TP393.0

【参考文献】