基于Tabu搜索的QoS多播路由快速优化算法  

A Tabu-Search-Based Fast QoS Multicast Routing Optimal Algorithm

作　　者：高茜[1] 罗军舟[1] 

机构地区：[1]东南大学计算机科学与工程系网络室,江苏南京210096

出　　处：《软件学报》2004年第12期1877-1884,共8页Journal of Software

基　　金：国家自然科学基金); 国家重点基础研究发展规划(973));高等学校博士学科点专项科研基金课题;江苏省"网络与信息安全"重点实验室~~

摘　　要：QoS多播路由算法的核心问题是建立满足QoS约束的多播树,这就是计算机网络中著名的受约束最小Steiner树问题,是一个NP完全问题.目前已有的启发式算法的时间复杂度大,不能获得最优解.提出了一个基于Tabu搜索的QoS多播路由选择快速优化算法,它选择延迟与带宽约束为QoS参数,利用Tabu搜索的集中性与广泛性并存的优点,在提高搜索速度的同时可以更加接近最优解.仿真结果表明:该算法具有快速、易实施等特点,更加适合在组规模比较大的情况下应用.The key problem of QoS multicast routing optimization algorithm is to build QoS constrained multicast tree. This is the most noted problem in computer networks as constrained minimum Steiner tree problem, which has also been shown as NP-complete. A fast multicast routing optimal algorithm with QoS constraints based on Tabu-search is proposed in this paper. It chooses delay and bandwidth as QoS parameters, can improve the search speed, and make a better solution by using the merits of Tabu-search. Simulation results with random network models show that TSQMA is faster, easier for implementation, and more suitable for large group scale.

关 键 词：多播路由 QOS TABU搜索 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]