摘要
针对网络通信中带时延约束的多播路由问题,提出了一种基于量子遗传退火策略的路由算法。文中对路由选择问题的优化模型进行了描述,并深入研究了量子遗传退火及其在多播路由选择优化问题中的应用。仿真实验表明,与基于遗传算法的多播路由算法相比,该算法具有更快的收敛速度和更好的全局寻优能力。
A method based on the quantum genetic annealing algorithm （QGAA） is presented to deal with the delay-constrained muhicast routing problem. The optimal model of the multicast routing problem is introduced, and QGAA and its application in the multicast routing problem are investigated deeply. Simulations show that compared with those based on the genetic algorithm, the multicast routing based on QGAA has a faster converging speed and better ability of global search.
出处
《计算机工程与科学》
CSCD
北大核心
2009年第10期12-14,共3页
Computer Engineering & Science
基金
江苏省教委科学基金资助项目(JS2007021)
关键词
多播路由
遗传算法
模拟退火算法
量子计算
multicast routing
genetic algorithm
simulated annealing
quantum computing
