摘要
提出了一种基于蚁群算法的满足带宽、时延、时延抖动、分组丢包率、费用多个QoS约束的动态组播路由算法(DM-ACA)。该算法使用逆向路径(Reverse path)机制,蚂蚁从目的节点出发寻找源节点,解决了组播网络动态变化的问题;通过引入洪泛(flooding)机制,初始群筛选(sieving)机制,加性增量乘性减量(AIMD)的信息素启发机制,解决了蚁群算法局部搜索能力弱、收敛速度慢、易于陷入局部最优解的问题。仿真结果表明,提出的算法可行有效。
Based on ant colony algorithm (ACA), a dynamic multicast QoS routing algorithm (DM-ACA) was presented for satisfying multiple constraints, such as bandwidth, delay, delay-jitter, package lost rate and cost. The algorithm uses a mechanism of reverse path to solve the problem of dynamic change of multicast network: ants start form destination to source node. Also, mechanisms as flooding, sieving of initial group, add-kind increment and multiply-kind decrease pheromone updating rule are put forward to resolve the problems of ACA, such as enhancing the ability of local searching, improving speed of constringency, avoiding trapped in local optimum. Simulation resuits showed that the proposed algorithm was feasible and effective.
出处
《重庆邮电大学学报(自然科学版)》
2007年第B06期92-95,共4页
Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition)
基金
北京市教委学科建设与研究生教育项目(XK100130548)
关键词
蚁群算法
动态组播
QOS
路由算法
ant colony algorithm (ACA)
dynamic multicast
QoS
routing algorithm