| 基于Tabu搜索的QoS多播路由快速优化算法 |
| |
| 引用本文： | 高茜,罗军舟. 基于Tabu搜索的QoS多播路由快速优化算法[J]. 软件学报, 2004, 15(12): 1877-1884 |
| |
| 作者姓名： | 高茜 罗军舟 |
| |
| 作者单位： | 东南大学,计算机科学与工程系,网络室,江苏,南京,210096 |
| |
| 基金项目： | Supported by the National Natural Science Foundation of China under Grant No90204009(国家自然科学基金);the National Grand Fundamental Research 973 Program of China under Grant No.G1998030402(国家重点基础研究发展规划(973));the China Specialized Research Fund for the Doctoral Program of Higher Education under Grant No.20030286014(高等学校博士学科点专项科研基金课题);the Key Laboratory of Network and Information Security of Jiangsu Province of China under Grant No.BM2003201(江苏省"网络与信息安全"重点实验室) |
| |
| 摘 要： | QoS多播路由算法的核心问题是建立满足QoS约束的多播树,这就是计算机网络中著名的受约束最小Steiner树问题,是一个NP完全问题.目前已有的启发式算法的时间复杂度大,不能获得最优解.提出了一个基于Tabu搜索的QoS多播路由选择快速优化算法,它选择延迟与带宽约束为QoS参数,利用Tabu搜索的集中性与广泛性并存的优点,在提高搜索速度的同时可以更加接近最优解.仿真结果表明:该算法具有快速、易实施等特点,更加适合在组规模比较大的情况下应用.
|
| 关 键 词： | 多播路由 QoS Tabu搜索 |
| 收稿时间： | 2004-02-13 |
| 修稿时间： | 2004-02-13 |
A Tabu-Search-Based Fast QoS Multicast Routing Optimal Algorithm |
| |
| GAO Qian and LUO Jun-Zhou. A Tabu-Search-Based Fast QoS Multicast Routing Optimal Algorithm[J]. Journal of Software, 2004, 15(12): 1877-1884 |
| |
| Authors: | GAO Qian and LUO Jun-Zhou |
| |
| Abstract: | 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. |
| |
| Keywords: | multicast routing QoS Tabu search |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《软件学报》浏览原始摘要信息 |
|
点击此处可从《软件学报》下载全文 |
