Computer Engineering and Applications ›› 2008, Vol. 44 ›› Issue (24): 121-123.DOI: 10.3778/j.issn.1002-8331.2008.24.036

• 网络、通信、安全 • Previous Articles     Next Articles

Application of ant colony algorithm in delay constrained anycast routing

XIAO Meng1,LI Tao-shen1,2   

  1. 1.School of Computer,Electronics and Information,Guangxi University,Nanning 530004,China
    2.School of Information Science and Engineering,Central South University,Changsha 410083,China
  • Received:2007-10-31 Revised:2008-01-07 Online:2008-08-21 Published:2008-08-21
  • Contact: XIAO Meng

蚁群算法在时延约束选播路由问题中的应用

肖 猛1,李陶深1,2   

  1. 1.广西大学 计算机与电子信息学院,南宁 530004
    2.中南大学 信息科学与工程学院,长沙 410083
  • 通讯作者: 肖 猛

Abstract: Based on studying anycast service and the application of ant colony algorithm in anycast routing,an anycast routing algorithm based on ant colony system principles to solve delay constrained problem is proposed in this paper.This algorithm uses the strategy of adjusting pheromone on best path and restarting algorithm,and can solve the problem that ant algorithm is easy to fall into local optimum solution.The results of simulation experiment show that the proposed algorithm is effective and feasible,and it can effectively find the best solution of the problem in condition of satisfying delay constraint.

Key words: Ant Colony Algorithm, delay constraint, anycast routing, Service of Quality(QoS)

摘要: 在分析选播通信服务的基础上,研究了蚁群算法在网络选播路由问题中的应用,提出了一种基于蚁群系统原理,用于解决有时延约束的选播路由问题。算法采用调整最优解路径上的信息素和算法重启策略,较好地解决了蚁群算法易于陷入局部最优的问题。仿真实验结果表明,该算法是有效且切实可行的,它可以在满足延时约束的条件下迅速找到最优解。

关键词: 蚁群算法, 时延约束, 选播路由, 服务质量(QoS)