一种MPLS网络拥塞最小化的全局路由优化算法

A Global Routing Optimization Algorithm with Minimum Congestion in MPLS Network

提出一种启发式群搜索双螺旋优化算法,求解MPLS网络路由全局优化问题,优化目标是使 网络拥塞最小化。算法采用群局部搜索,利用混沌变量产生一组分布好的初始解,在邻域搜索过程中融入启 发式信息,并设计了特别的贪婪重路由以及扩展贪婪原则,提高了算法效率和全局搜索能力。通过仿真比较 说明了所提算法的有效性,及其显著改善网络性能的意义。

A heuristic algorithm based on group local search and double spiral process is proposed in this article, which is applied to optimizing global routing with the objective of network congestion minimization. It makes use of chaos variable to find initial solutions with favorable distribution, combines with heuristic knowledge in local search process, and puts forward especial greedy rerouting and extended greedy principal, all of which are to increase efficiency and global search ability. Simulations manifest its effectiveness and notable virtual value in improving network performance.