Abstract: The paper presents a QoS-constrains best routing algorithm for the problem of service in network—ant colony algorithm (ACA), the algorithm is a new optimization . In this paper, the performance of ACA is approved by dynamically adjusting evaporation rate of pheromone and applying the global updating rule of the best and the worst path. The improved algorithm can find the global optimum at higher convergence speed. The simulation results demonstrate that the above approach is reasonable and efficient.

Key words: ant colony algorithm, QoS routing, minimal cost

摘要： 针对当前通信网络中存在的服务质量问题而提出的满足QoS约束的最佳路由选择算法——蚁群算法，该算法是一种新型的进化算法，与其它进化算法一样存在搜索时间过长和易于陷入局部最优解等缺陷。针对以上缺陷，本文提出一种通过动态地调整信息素的挥发度和采用最优、最差路径信息素全局更新策略得以克服。改进型算法能较快地收敛到全局最优解。仿真结果表明上述方法是可行和有效的。

关键词: 蚁群算法, QoS路由选择, 最小代价