摘要
为寻找满足带宽、延迟等约束的最小代价组播路由树的QoS组播路由,提出一种分布式蚁群优化算法。在蚂蚁行动过程中形成组播树的森林。若在某步结束时森林中仅剩1棵树,则蚂蚁达到目标,停止行动。仿真实验结果表明,该算法在结果和收敛速度方面都有良好的表现。
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.
出处
《计算机工程》
CAS
CSCD
北大核心
2010年第6期111-113,共3页
Computer Engineering
基金
国家自然科学基金资助项目"大规模组播聚合模型及算法研究"(60773101)
下一代网络示范工程基金资助项目"大规模路由和组播技术的研究与试验"(CNGI-04-13-2T)
关键词
服务质量
组播路由
蚁群优化算法
分布式实现
QoS
multicast routing
ant colony optimization algorithm
distributed implementation
