计算机工程与应用 ›› 2011, Vol. 47 ›› Issue (27): 126-128.

• 网络、通信、安全 • 上一篇    下一篇

求解QoS组播路由的生长竞争蚁群算法

朱 刚1,马 良2,管 屏1,邱勇平1   

  1. 1.上海第二工业大学 电子与电气工程学院,上海 201209
    2.上海理工大学 管理学院,上海 200093
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2011-09-21 发布日期:2011-09-21

Growing competitive ant algorithm for QoS multicast routing

ZHU Gang1,MA Liang2,GUAN Ping1,QIU Yongping1   

  1. 1.College of Electronic and Electric Engineering,Shanghai Second Polytechnic University,Shanghai 201209,China
    2.College of Management,University of Shanghai for Science and Technology,Shanghai 200093,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2011-09-21 Published:2011-09-21

摘要: 基于生长竞争蚁群算法,提出一种解决QoS组播路由问题的算法。算法引入生长竞争机制,使算法更好更快向最优解逼近。实验结果表明,该算法是可行和有效的。

关键词: 生长竞争蚁群算法, 组播路由, 服务质量

Abstract: For solving the QoS multicast routing problem,this paper proposes an algorithm for multicast routing based on growing competitive ant algorithm.This algorithm uses a rule of growing competitive in order to approach to optimal solution.The experimental results illustrate that the algorithm is feasible and effective.

Key words: growing competitive ant algorithm, multicast routing, quality of service