计算机工程 ›› 2010, Vol. 36 ›› Issue (06): 111-113.doi: 10.3969/j.issn.1000-3428.2010.06.037

• 网络与通信 • 上一篇    下一篇

分布式蚁群QoS组播路由算法

许 洪,王 华,伊善文   

  1. (山东大学计算机科学与技术学院,济南 250101)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2010-03-20 发布日期:2010-03-20

Distributed Ant Colony QoS Multicast Routing Algorithm

XU Hong, WANG Hua, YI Shan-wen   

  1. (School of Computer Science and Technology, Shandong University, Jinan 250101)
  • Received:1900-01-01 Revised:1900-01-01 Online:2010-03-20 Published:2010-03-20

摘要: 为寻找满足带宽、延迟等约束的最小代价组播路由树的QoS组播路由,提出一种分布式蚁群优化算法。在蚂蚁行动过程中形成组播树的森林。若在某步结束时森林中仅剩1棵树,则蚂蚁达到目标,停止行动。仿真实验结果表明,该算法在结果和收敛速度方面都有良好的表现。

关键词: 服务质量, 组播路由, 蚁群优化算法, 分布式实现

Abstract: According to the QoS multicast routing problem, which is to find the least cost multicast routing tree that satisfies bandwidth, delay and other constraints, this paper proposes a distributed ant colony optimization algorithm. In this algorithm, a multicast tree’s forest is formed during the ant movement progress. The objective of ant movement is to connect all the trees in the forest to form a single tree. The most important advantage of the algorithm is distributed implementation. Simulation experiments show that this algorithm performs well both in results and convergence speed.

Key words: QoS, multicast routing, ant colony optimization algorithm, distributed implementation

中图分类号: