检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:周睿 何利文[1] 唐澄澄 侯小宇 陆钱春[2] ZHOU Rui;HE Li-wen;TANG Cheng-cheng;HOU Xiao-yu;LU Qian-chun(Nanjing University of Posts and Telecommunications,Nanjing 210003,China;ZTE Corporation,Nanjing 210012,China)
机构地区:[1]南京邮电大学,江苏南京210003 [2]中兴通讯股份有限公司,江苏南京210012
出 处:《计算机技术与发展》2019年第7期17-22,共6页Computer Technology and Development
基 金:2012年国家发改委信息安全专项(GJ215001);南京邮电大学引进人才科研启动基金资助项目(NY212012)
摘 要:SDN控制器的出现有效地解决了传统网络设施僵化等问题,它可以通过自身的网络拓扑模块掌握全局拓扑,并且计算出符合全局最优的网络路径。但是,现如今的网络环境日益复杂,想要计算出可以有效满足带宽、时延、丢包率等约束的路由变得尤为困难,传统的精确算法已经很难满足各种网络业务的需求。实际上计算满足多目标多约束的路径问题本质上属于多目标优化问题(MOP),很难用精确的数学方法解决。所以借助启发式算法的思想,针对该问题,提出了一种改进的多目标约束遗传算法来找到全局最优的路径,在传统遗传算法的基础下根据网络的特性,对初始种群生成的算法进行了改进,使得初始路径满足了大部分的约束条件,实现对传统的计算路径算法的增强及优化的目标。实验结果表明,该算法可以在满足各种业务约束条件的前提下达到多个路径优化目标的效果。The emergence of SDN controller effectively solves the problems such as the rigidity of traditional network facilities.It can master the global topology through its own network topology module and calculate the network path that conforms to the global optimal.However,nowadays,with the increasingly complex network environment,it is particularly difficult to calculate the routing that can effectively meet the constraints of bandwidth,delay,packet loss rate and so on,and the traditional precision algorithm has been difficult to meet the requirements of various network services.In fact,the computation of a path problem that satisfies multiple objectives and multiple constraints is essentially a multi-objective optimization problem (MOP),which is difficult to solve with precise mathematical methods.Therefore,with the aid of the heuristic algorithm,an improved multi-objective constrained genetic algorithm to find the global optimal path is put forward.Based on the characteristics of the network,the algorithm of initial population generation is improved based on the traditional genetic algorithm,so that the initial path satisfies most of the constraints,achieving the goal of enhancing and optimizing the traditional computation path algorithm.The experiment shows that the proposed algorithm can achieve the effect of multiple path optimization objectives under the premise of meeting various business constraints.
关 键 词:SDN控制器 路由算法 多约束遗传算法 多目标优化
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15