双向搜索蚁群算法在QoS单播路由中的应用  

Application of bi-directional search ant colony algorithm in unicast routing with QoS constraints

作　　者：何志东[1] 俞鹤伟[1] 陶铭[1] 

机构地区：[1]华南理工大学计算机科学与工程学院,广州510006

出　　处：《计算机工程与应用》2010年第31期106-108,共3页Computer Engineering and Applications

基　　金：广东省科技计划工业攻关项目No.2006A10101004;No.2008B010200036~~

摘　　要：近几年来,网络的QoS路由问题已经成为一个研究热点。考虑到现有解决方法的一些不足,引入了一种改进的蚁群算法并应用于QoS单播路由问题。该算法针对网络路由问题,对原算法的信息素更新策略进行了修改,同时结合了网络化简策略和双向搜索策略。与现有QoS路由算法比较的仿真结果表明,该算法能够满足QoS单播路由的要求,并且具有较好的最优解求解能力、较快的收敛速度和较强的鲁棒性。In recent years,the QoS routing of the network has been a focus.Considering the disadvantages of the existing algorithms, an improved ant colony algorithm is proposed in this paper and applied to the unicast routing with QoS constraints. The proposed algorithm has made some modifications in the pheromone updating rule, at the same time;it has combined the policies of network simplifying and bi-directional searching.The simulation results based on the comparison with other existing heuristic algorithms show that this algorithm has the advantages in terms of better global searching ability,higher convergence speed,and stronger robust.

关 键 词：服务质量 单播路由 双向搜索 蚁群算法 

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