摘要
本文对现代网络中具有带宽和时延约束的QoS单播路由的问题提出了一种基于改进蚁群的路由优化算法。该算法针对蚁群算法的不足引入了可拓学,在算法的计算的过程中,根据条件对其关键参数进行可拓变换。仿真实验证明该算法具有更好的搜索性和收敛性。
For QoS unicast routing problem under the constrains of bandwidth and delay in modermnetworks,a new routing optimization based on improved Ant Colony Algorithm is proposed.For the lack of Ant Colony Algorithm this paper introduce the extenics,in the computational process, the key parametersdoextension transformations according to the conditions.Simulation experiments show that the algorithm has better search quality and convergence quality.
出处
《软件》
2013年第4期42-45,共4页
Software
关键词
蚁群算法
可拓变换
QOS路由
单播路由
Ant Colony Algorithm
Extension transformation
QoSrouting
unicast routing
