基于蚁群改进算法的服务质量路由研究  

QoS Routing Research Based on Ant Colony Improved Algorithm

作　　者：孙佳林[1] 王云松[1] 龚跃[1] 

机构地区：[1]长春理工大学计算机科学技术学院,长春130022

出　　处：《长春理工大学学报（自然科学版）》2017年第5期104-108,共5页Journal of Changchun University of Science and Technology(Natural Science Edition)

摘　　要：针对传统路由算法在多约束QoS(服务质量)条件下寻优能力不足的问题,提出了一种基于改进蚁群算法的多约束QoS路由模型。相比于传统的路由算法,此方法在每次循环结束时,根据得到的不同结果动态变化相关参数的值,并且结合最大最小蚂蚁系统的理论,同时优化启发函数,以提高算法的寻优能力。另外,除了考虑多个约束条件以外,在模型中还加入了故障率属性,将其体现在目标函数中,并优化信息素更新方式。仿真实验结果表明改进算法寻优能力强,能有效避免早熟,并避开故障率高的路径。In order to solve the problem that the searching ability of the traditional routing algorithm is insufficient un-der the condition of multi-constrained QoS （Quality of Service）,the model of multi-constrained QoS routing based on the improved ant colony algorithm is proposed. Compared with the traditional routing algorithm,this method dynamical-ly changes the value of related parameters according to the different results when each loop ends, combines the theory of the Max-Min ant system and the heuristic function is optimized to improve the optimizing ability of the algorithm. In addition, the failure rate is added to the model except the multiple constraints, and is presented in the objective function, and the pheromone update mode is optimized. The simulation results show that the improved algorithm has strong optimization ability,and can effectively avoid premature and avoid the path with high failure rate.

关 键 词：蚁群算法 动态参数 QOS路由 故障率 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]