北京邮电大学学报

  • EI核心期刊

北京邮电大学学报

• 学术论文 • 上一篇    下一篇

 一种优化的LSP路由规划算法 

    

  1. 北京邮电大学 继续教育学院 , 北京 100876
  • 基金资助:
    国家自然科学基金资助项目 (69802003); 教育部学科点专项科研基金资助项目(20020013011) 

An Optimal Algorithm for LSP Route Programming

    

  1. Continuing Education School, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • Supported by:
     

摘要: 以均衡网络业务量为优化目标 ,提出一种基于启发式自适应遗传算法的 LSP路由优化算法 ,采用自适应的交叉变异算子 ,并加入启发式信息有效地提高了搜索效率 . 仿真结果证明 ,该算 法大大地改善了传统SPF路由算法易于导致的网络流量分布不均衡的状况. 与简单遗传算法相 比 ,该算法性能更稳定 ,并且提高了优化性能以及算法效率. 

关键词: 流量工程, 负载均衡 , 遗传算法 

Abstract: An algorithm based on genetic algorithm for optimizing LSP route programming with the objective of load balancing is proposed, which introduces adaptive probabilities of crossover and mutation, and furthermore, makes use of heuristic information to improve search efficiency effectively. The simulation results show our algorithm is effective, in which it dramatically improves the unbalanced traffic distribution condition brought about by traditional SPF routing policy. In addition it has a superior performance over the standard genetic algorithm in aspects such as stability, optimization performance and efficiency.

Key words:

中图分类号: