一种在DS-TE网络环境中新的LSP抢占算法  

A New LSP Preemption Algorithm for DS-TE Network

作　　者：唐乙双[1] 田波[1] 

机构地区：[1]中国电子科技集团公司第三十研究所,四川成都610041

出　　处：《通信技术》2009年第12期51-53,共3页Communications Technology

摘　　要：现有的启发式抢占算法不易找到最优解,容易造成带宽的浪费。文中通过分析DS-TE(Differentiated Services Traffic Engineering)网络环境中的抢占策略,提出了一种优化的抢占算法GA-PREPT(Genetic Algorithm Preemption)。GA-PREPT利用遗传算法进行LSP(Label Switch Path)的优化选择,同时针对抢占问题的约束条件在进行选择操作时引入模拟退火选择算子,指导进化过程的选择操作。仿真结果表明GA-PREPT性能相比现有的启发式抢占算法有较大改善。The heuristic preemption currently used to select LSP could not easily find the best solutions and wastes the bandwidth. This paper, by analyzing the preemption policy in DS-TE networks, proposes an optimized preemption policy named GA-PREPT. This new preemption selects the preempted LSP via an improved genetic algorithm. The annealing selecting operator is also introduced to handle the constrained optimization problem and guide the evolutionary process. Simulation results show that the proposed algorithm significantly outperforms the recently-proposed heuristic.

关 键 词：抢占算法 遗传算法 模拟退火选择算子 

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