| 分布式蚁群QoS组播路由算法 |
| |
| 引用本文： | 许洪,王华,伊善文.分布式蚁群QoS组播路由算法[J].计算机工程,2010,36(6):111-113. |
| |
| 作者姓名： | 许洪 王华 伊善文 |
| |
| 作者单位： | 山东大学计算机科学与技术学院,济南,250101 |
| |
| 基金项目： | 国家自然科学基金资助项目“大规模组播聚合模型及算法研究”(60773101);;下一代网络示范工程基金资助项目“大规模路由和组播技术的研究与试验”(CNGI-04-13-2T) |
| |
| 摘 要： | 为寻找满足带宽、延迟等约束的最小代价组播路由树的QoS组播路由，提出一种分布式蚁群优化算法。在蚂蚁行动过程中形成组播树的森林。若在某步结束时森林中仅剩1棵树，则蚂蚁达到目标，停止行动。仿真实验结果表明，该算法在结果和收敛速度方面都有良好的表现。
|
| 关 键 词： | 服务质量 组播路由 蚁群优化算法 分布式实现 |
| 修稿时间： | |
Distributed Ant Colony QoS Multicast Routing Algorithm |
| |
| XU Hong,WANG Hua,YI Shan-wen.Distributed Ant Colony QoS Multicast Routing Algorithm[J].Computer Engineering,2010,36(6):111-113. |
| |
| Authors: | XU Hong WANG Hua YI Shan-wen |
| |
| Affiliation: | (School of Computer Science and Technology, Shandong University, Jinan 250101) |
| |
| 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.Simulaion experiments show that this algorithm performs well both in results and convergence speed. |
| |
| Keywords: | QoS multicast routing ant colony optimization algorithm distributed implementation |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
