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

An Optimal Algorithm for LSP Route Programming

作　　者：刘红[1] 丁炜[1] 

机构地区：[1]北京邮电大学继续教育学院,北京100876

出　　处：《北京邮电大学学报》2003年第3期37-41,共5页Journal of Beijing University of Posts and Telecommunications

基　　金：国家自然科学基金资助项目(69802003);教育部学科点专项科研基金资助项目(20020013011)

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

关 键 词：流量工程 负载均衡 遗传算法 LSP路由算法 SPF路由 网络流量 

分 类 号：TN915.0[电子电信—通信与信息系统]