基于蚁群优化算法的多QoS选播路由算法研究  

Research on Multiple QoS Anycast Routing Algorithm Based on Ant Colony Algorithm

作　　者：李陶深[1] 肖猛[1] 葛志辉[1] 赵志刚[1] 

机构地区：[1]广西大学计算机与电子信息学院,广西南宁530004

出　　处：《微电子学与计算机》2010年第8期91-95,共5页Microelectronics & Computer

基　　金：国家自然科学基金项目(60963022);广西自然科学基金项目(桂科自0640026)

摘　　要：提出一种基于蚁群优化算法的多QoS选播路由算法.算法设计了合理的路径评价方法,从平衡网络负载的角度出发,寻找适当的选播路由路径.通过对迭代最优解路径上的信息素的调整和算法重启的策略,算法有效地避免了陷入局部最优的缺陷,扩大了算法的搜索范围.实验结果表明,该算法能找到满足QoS约束的全局最优解,并在资源预留的基础上较好地满足用户对于带宽、时延的要求.A new QoS anycast routing algorithm based on an ant colony algorithm is proposed in this paper. In order to search a reasonable anycast routing path, a felicitous estimate method of the optimization path is designed and the load balance is considered. By adjusting the pheromone in the iteration-best path and re-initializing the algorithm, the proposed algorithm can efficiently avoid falling into local optimal and it can enlarge global searching. The results of the simulating experiment show that the algorithm can effectively find the global-best solution that satisfied the QoS constraint and balance the load of networks, and also can be utilized to satisfy the need of the clients for bandwidth, delay and cost on the basis of resource reservation.

关 键 词：蚁群算法 选播路由 QOS约束 负载平衡 

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