[1]周 睿,何利文,唐澄澄,等.基于多目标约束遗传算法的 SDN 路径增强算法[J].计算机技术与发展,2019,29(07):17-22.[doi:10. 3969 / j. issn. 1673-629X. 2019. 07. 004]
　ZHOU Rui,HE Li-wen,TANG Cheng-cheng,et al.SDN Path Enhancement Algorithm Based on Multi-objective Constraint Genetic Algorithm[J].,2019,29(07):17-22.[doi:10. 3969 / j. issn. 1673-629X. 2019. 07. 004]
点击复制

基于多目标约束遗传算法的 SDN 路径增强算法()
分享到：

《计算机技术与发展》[ISSN:1006-6977/CN:61-1281/TN]

卷:
29
期数:
2019年07期
页码:
17-22
栏目:
智能、算法、系统工程
出版日期:
2019-07-10

文章信息/Info

Title:
SDN Path Enhancement Algorithm Based on Multi-objective Constraint Genetic Algorithm
文章编号:
1673-629X(2019)07-0017-06
作者:
周 睿1 ; 何利文1 ; 唐澄澄1 ; 侯小宇1 ; 陆钱春2
1. 南京邮电大学,江苏 南京 210003; 2. 中兴通讯股份有限公司,江苏 南京 210012
Author(s):
ZHOU Rui 1 ; HE Li-wen 1 ; TANG Cheng-cheng 1 ; HOU Xiao-yu 1 ; LU Qian-chun 2
1. Nanjing University of Posts and Telecommunications,Nanjing 210003,China; 2. ZTE Corporation,Nanjing 210012,China
关键词:
SDN 控制器; 路由算法; 多约束遗传算法; 多目标优化
Keywords:
SDN controller; routing algorithm; multi-objective genetic algorithm; multi-objective optimization
分类号:
TP301.6
DOI:
10. 3969 / j. issn. 1673-629X. 2019. 07. 004
摘要:
SDN 控制器的出现有效地解决了传统网络设施僵化等问题,它可以通过自身的网络拓扑模块掌握全局拓扑,并且计算出符合全局最优的网络路径。 但是,现如今的网络环境日益复杂,想要计算出可以有效满足带宽、时延、丢包率等约束的路由变得尤为困难,传统的精确算法已经很难满足各种网络业务的需求。 实际上计算满足多目标多约束的路径问题本质上属于多目标优化问题(MOP),很难用精确的数学方法解决。 所以借助启发式算法的思想,针对该问题,提出了一种改进的多目标约束遗传算法来找到全局最优的路径,在传统遗传算法的基础下根据网络的特性,对初始种群生成的算法进行了改进,使得初始路径满足了大部分的约束条件,实现对传统的计算路径算法的增强及优化的目标。 实验结果表明,该算法可以在满足各种业务约束条件的前提下达到多个路径优化目标的效果。
Abstract:
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.

相似文献/References:

[1]段军,张清磊.蚁群算法在LEACH路由协议中的应用[J].计算机技术与发展,2014,24(01):65.
　DUAN Jun,ZHANG Qing-lei.Application of Ant Colony Algorithm Based on LEACH Routing Protocol[J].,2014,24(07):65.
[2]邵星 王汝传 徐小龙.一种基于Agent的Ad hoc网络路由算法[J].计算机技术与发展,2010,(04):21.
　SHAO Xing,WANG Ru-chuan,XU Xiao-long.A Kind of Agent- Based Network Routing Algorithm for Ad hoc Networks[J].,2010,(07):21.
[3]吴征 朱军 韩永远.一种新的基于LEACH的WSN分簇协议[J].计算机技术与发展,2010,(05):29.
　WU Zheng,ZHU Jun,HAN Yong-yuan.A New LEACH-Based Clustering Protocol for Wireless Sensor Networks[J].,2010,(07):29.
[4]闫倩倩 许勇 夏海燕.一种ZigBee路由算法的分析与改进[J].计算机技术与发展,2009,(12):59.
　YAN Qian-qian,XU Yong,XIA Hai-yan.Analysis and Improvement of a Routing Algorithm in Wireless Sensor Network Based on ZigBee[J].,2009,(07):59.
[5]唐启涛 陶滔 伍海波.基于最小生成树的LEACH路由算法研究[J].计算机技术与发展,2009,(04):109.
　TANG Qi-tao,TAO Tao,WU Hai-bo.Study of Minimum Spanning Tree Routing Algorithm in LEACH[J].,2009,(07):109.
[6]李彦华 黄华 王玉 孙绪荣.EIGRP与OSPF两种动态路由协议的分析比较[J].计算机技术与发展,2006,(10):35.
　LI Yan-hua,HUANG Hua,WANG Yu,et al.Analysis and Comparison about EIGRP and OSPF[J].,2006,(07):35.
[7]赵振东 刘方爱.一种基于分区的移动P2P网络路由算法[J].计算机技术与发展,2011,(09):47.
　ZHAO Zhen-dong,LIU Fang-ai.A Partition-Based Routing Algorithm for Mobile P2P Network[J].,2011,(07):47.
[8]罗樵 陈靖 郭一辰 黄聪慧.一种基于Chord算法的MANET的优化策略[J].计算机技术与发展,2011,(11):42.
　LUO Qiao,CHEN Jing,GUO Yi-chen,et al.A MANET Optimization Strategy Based on Chord Algorithm[J].,2011,(07):42.
[9]陈春玲 张玲.分层混合路由协议的研究与仿真[J].计算机技术与发展,2011,(11):137.
　CHEN Chun-ling,ZHANG Ling.Research and Simulation of Hierarchical Mix Routing Protocol[J].,2011,(07):137.
[10]周瑜 李明 郁磊.工业监控中无线传感器网络路由算法的研究[J].计算机技术与发展,2011,(11):185.
　ZHOU Yu,LIMing,YU Eei.Research on Routing Algorithm of WSN in Industrial Control[J].,2011,(07):185.

更新日期/Last Update: 2019-07-10