Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (23): 123-126.DOI: 10.3778/j.issn.1002-8331.2009.23.034

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

Research on QoS multicast routing problem based on novel ant colony algorithm

ZHANG Ling,MAO Li   

  1. School of Information Engineering,Southern Yangtze University,Wuxi,Jiangsu 214122,China
  • Received:2008-05-06 Revised:2008-08-12 Online:2009-08-11 Published:2009-08-11
  • Contact: ZHANG Ling

基于一种新的蚁群算法的QoS组播路由问题的研究

张 凌,毛 力   

  1. 江南大学 信息工程学院,江苏 无锡 214122
  • 通讯作者: 张 凌

Abstract: In allusion to the flaws of ant colony algorithm,a multi-behaved ant colony algorithm in combination with QPSO is presented for solving the QoS multicast routing problem.Firstly it adopts QPSO algorithm to approach early stage searching,and then initializing the concentration of pheromone based on each particle’s historical optimum value,finally it makes use of multi-behaved ant colony algorithm to optimize the path.The simulation results have demonstrated that this algorithm has strong optimization ability and high reliability.It’s the effective algorithm in solving QoS multicast routing problem.

摘要: 在解决QoS(Quality of Service)组播路由问题上,针对蚁群算法缺点,提出了一种融合量子粒子群算法(QPSO)思想的多行为蚁群算法。该算法采用QPSO作为前期搜索,根据各粒子历史最优值来初始化路径信息素浓度,后期利用多行为蚁群算法来优化路径。仿真结果表明:该算法寻优能力强,可靠性高,是解决QoS组播路由问题的有效方法。

CLC Number: