| 一种时延约束最小代价路由选择算法 |
| |
| 引用本文： | 房颉,王珩,孙亚民.一种时延约束最小代价路由选择算法[J].计算机应用研究,2005,22(6):216-218. |
| |
| 作者姓名： | 房颉 王珩 孙亚民 |
| |
| 作者单位： | 南京理工大学,计算机科学与技术系,江苏,南京,210094 |
| |
| 摘 要： | 使用禁忌搜索方法寻找最优路径，将最小时延路径作为初始解，在满足时延约束的情况下根据禁忌搜索规则求解代价最小的路径。仿真实验证明DCLC_TSR算法具有代价性能良好、可靠性高、耗时少、收敛速度快的优越特点。
|
| 关 键 词： | QoS路由 时延约束 代价最小 禁忌搜索 k条最短路径 |
| 文章编号： | 1001-3695(2005)06-0216-03 |
A Heuristic Algorithm for Delay-constrained Least-cost Unicast Routing |
| |
| FANG Jie,WANG Heng,SUN Ya-min.A Heuristic Algorithm for Delay-constrained Least-cost Unicast Routing[J].Application Research of Computers,2005,22(6):216-218. |
| |
| Authors: | FANG Jie WANG Heng SUN Ya-min |
| |
| Affiliation: | (Dept.of Computer Science & Technology, Nanjing University of Science & Technology, Nanjing Jiangsu 210094,China) |
| |
| Abstract: | Makes use of the tabu search method to get the optimized solution. It starts with an initial least delay path, generates neighborhood structure based on the kth shortest path algorithm, and finds the optimized route satisfying constraint. A large number of simulations demonstrate that the algorithm has advantages of nice cost performance, high reliability, and fast convergence speed. |
| |
| Keywords: | QoS Routing Delay-constrained Least-cost Tabu Search k th Shortest Path Algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用研究》浏览原始摘要信息 |
|
点击此处可从《计算机应用研究》下载全文 |
