基于动态流量的多拓扑链路权值优化算法

计算机科学 ›› 2013, Vol. 40 ›› Issue (4): 86-90.

基于动态流量的多拓扑链路权值优化算法

陈铎龙,孟相如,梁霄,温祥西

空军工程大学信息与导航学院西安710077;空军工程大学信息与导航学院西安710077;空军工程大学信息与导航学院西安710077;空军工程大学信息与导航学院西安710077

出版日期:2018-11-16 发布日期:2018-11-16
基金资助:
本文受国家自然科学基金(61003252,61201209),全军军事学研究生课题(2011JY002-524)资助

Multi-topology Link Weight Optimizing Algorithm Based on Dynamic Traffic

CHEN Duo-long,MENG Xiang-ru,LIANG Xiao and WEN Xiang-xi

Online:2018-11-16 Published:2018-11-16

摘要/Abstract

摘要： 针对网络流量动态变化和不同流量对拥塞控制和传输代价的要求不同的现象,提出一种基于小生境粒子群的多拓扑路由子层链路权值优化算法。该算法以适应网络流量动态变化为目标,设置了以时段划分的业务量矩阵和适应流量动态变化要求的权重因子。优化目标函数从拥塞代价影响和传输代价影响两方面进行了改进,并利用小生境粒子群算法对目标函数进行寻优,以解决一般优化算法存在的容易陷入局部最优的问题。实验结果表明,算法能够在网络中实现负载均衡。

关键词: 流量工程,链路权值,小生境粒子群,多拓扑路由

Abstract: Considering the characteristic that network traffic change is dynamic and different traffics demand for congestion control and transmission cost are different,a link weights optimizing algorithm for multi-topology routing sub-layer based on niche particle swarm optimizer (NPSO) was proposed．The traffic matrix differentiated by periods and weight gene following different traffic demands were set to adapting the dynamic changing of network traffic．The congestion and transmission cost were considered in optimizing objective function,and NPSO was used to solve the optimization problem．The experimental result shows that the new algorithm can balance the load in network.

Key words: Traffic engineering,Link weight,Niche particle swarm optimizer,Multi-topology routing

陈铎龙,孟相如,梁霄,温祥西. 基于动态流量的多拓扑链路权值优化算法[J]. 计算机科学, 2013, 40(4): 86-90. https://doi.org/

CHEN Duo-long,MENG Xiang-ru,LIANG Xiao and WEN Xiang-xi. Multi-topology Link Weight Optimizing Algorithm Based on Dynamic Traffic[J]. Computer Science, 2013, 40(4): 86-90. https://doi.org/

参考文献

[1] Fortz B,Thorup M．Internet traffic engineering by optimizingOSPF weights[C]∥Proceedings of IEEE infocom 2000．Te-Aviv,Israel,2000:519-528
[2] Fortz B,Thorup M．Optimizing OSPF/IS-IS weights in a changing world[J]．IEEE Journal on Selected Areas in Communications,2005,0(4):756-767
[3] Karthik L,Matthew C,Murali R,et al．Achieving convergence-free routing using failure- carrying packets[J]． Proceedings of ACMSIGCOMM,2007,37(4):241-252
[4] 于涛,陈山枝,李昕,等.一种通过优化链路权值来增强网络生存性的方案[J].高技术通讯,2008,8(7):661-665
[5] 吴静,郭成城,晏蒲柳,等.基于动态流量矩阵的网络链路权值调整方法[J].华中科技大学学报,2007,5(7):76-79
[6] 袁荣坤,孟相如,李明迅,等.基于粒子群权值优化的网络可生存性增强方法[J].计算机应用,2012,2(1):127-130
[7] 黄赫,王晟.多拓扑路由实现IP网络区分服务的优化算法[J].计算机应用研究,2010,7(12):4735-4737
[8] Brits R,Engelbrchta P,Bergh F D．A niching particle swarm optimizer[C]∥Proceedings Conf．on simulated evolution and learning．Singapore,2002:1037-1040
[9] Scheffel M C,Gruber C G,Schwabe T,et al．Optimal multi-topology routing for IP resilience[J]．International journal of electronics and communications,2006(60):35-39
[10] 徐明伟,杨芫,李琦．域内自愈路由研究综述[J]．电子学报,2009,7(12):2753-2761

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed