IP网络弹性路由层拓扑生成优化算法

Optimizing Algorithm for Resilient Routing Layers Topology Building of IP Networks

  • 摘要: 针对弹性路由层快速重路由技术存在的重路由路径偏长的问题, 提出了一种基于单亲遗传算法的弹性路由拓扑子层生成算法. 介绍了弹性路由层基本原理, 给出了弹性路由层的矩阵表示定义, 分别建立了以平均最短重路由路径长度和重要度加权的最短重路由路径长度为优化目的的弹性路由层生成数学规划模型, 给出了单亲遗传算法求解该优化问题的方法步骤. 实验结果表明, 优化算法可以得到最佳的弹性路由层拓扑结构, 与Minimum算法、Rich算法相比, 明显缩短了重路由路径长度, 提高了流量转发效率.

     

    Abstract: The fast rerouting paths of resilient routing layers are not short enough to deliver traffic efficiently. To solve this problem, a resilient routing sub-layer building algorithm based on Partheno-genetic algorithm is proposed. The matrix expression of resilient routing layers is given. The optimizing models respectively with average minimum rerouting path length and weighted minimum rerouting path length are put forward. The method and steps to solve the optimizing problem based on Partheno-genetic algorithm are given. Experimental results show that the optimal topology structure of resilient routing layers could be acquired by the optimizing algorithm. Compared with minimum algorithm and Rich algorithm, the optimizing algorithm can reduce the rerouting path length and improve the efficiency of traffic forwarding.

     

/

返回文章
返回