| QoS多约束优化路径选择算法 |
| |
| 引用本文： | 陈立家,周建国,江昊,晏蒲柳.QoS多约束优化路径选择算法[J].计算机应用,2005,25(4):900-902. |
| |
| 作者姓名： | 陈立家 周建国 江昊 晏蒲柳 |
| |
| 作者单位： | 武汉大学电子信息学院 |
| |
| 基金项目： | 国家自然科学基金资助项目(90204008) |
| |
| 摘 要： | 针对HMCOP算法在QoS多约束最优路径选择中存在产生累积误差,搜索范围不全面 的缺点,提出了一种改进的算法LMS,使用BFS算法双向搜索网络拓扑,在每个节点实时监测最优路 径。最优路径成功率的仿真实验表明,该算法有更低的时间复杂度和更高的性能表现。
|
| 关 键 词： | 多约束 路径选择 QoS路由 最小花费 |
| 文章编号： | 1001-9081(2005)04-0900-03 |
Multi-constrained optimal path selection of QoS |
| |
| CHEN Li-jia,ZHOU Jian-guo,JIANG Hao,Yan Pu-liu.Multi-constrained optimal path selection of QoS[J].journal of Computer Applications,2005,25(4):900-902. |
| |
| Authors: | CHEN Li-jia ZHOU Jian-guo JIANG Hao Yan Pu-liu |
| |
| Affiliation: | School of Electronics Information,Wuhan University |
| |
| Abstract: | Aiming at the shortcomings of H_MCOP algorithm that produces cumulate error and searches network only partly in multi-constrained optimal path selection of QoS, a improved heuristic algorithm LMS was put forward, which searches network from two directions using BFS algorithm and supervises the optimal path at each node.The simulation experiment of success rate of finding optimal path indicates that LMS has lower time complexity and upper performance than H_MCOP. |
| |
| Keywords: | multi-constrained path selection QoS route the least cost |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用》浏览原始摘要信息 |
|
点击此处可从《计算机应用》下载全文 |
