一种基于IP网络的QoS约束组播路由算法  

Multicast routing algorithm with QoS constraint based on IP network

作　　者：吕锋[1] 黄珂[1] 

机构地区：[1]武汉理工大学信息工程学院,武汉430070

出　　处：《计算机工程与应用》2008年第15期99-102,共4页Computer Engineering and Applications

基　　金：国家自然科学基金国际合作与交流项目(No.50620130441);教育部重点实验室开放基金(No.TKLJ0203)

摘　　要：针对时延约束最小代价组播路由问题,结合禁忌搜索算法和模拟退火算法的优点,提出了一种改进的混合遗传路由算法TSSAGMA。通过分析与仿真,证实了该算法在解决时延约束最小代价组播路由的问题上优于传统算法,能够在较小的代价下搜索到较好的解。Based on traditional genetic algorithm,tabu search algorithm and simulated annealing algorithm,an improved hybrid genetic algorithm：TSSAGMA is proposed,which combines the merits of tabu search algorithm and simulated annealing algorithm.TSSAGMA introduces the unique memory function of tabu search into the searching process of genetic algorithm,and utilizes tabu search to construct the operators of genetic algorithm.Moreover,the result of simulation shows that TSSAGMA is better than traditional algorithms in solving the least cost multicast routing problem with delay constraint and it is able to obtain better solution with less cost.

关 键 词：QOS 时延约束 一种组播路由算法 IP网络 

分 类 号：TP311.11[自动化与计算机技术—计算机软件与理论]