| 一种启发式算法在多受限QoS路由中的研究 |
| |
| 引用本文： | 朱文琦,张德向,陈亚林.一种启发式算法在多受限QoS路由中的研究[J].计算机工程与设计,2004,25(4):569-571,578. |
| |
| 作者姓名： | 朱文琦 张德向 陈亚林 |
| |
| 作者单位： | 1. 武汉大学计算机学院,湖北,武汉,430079
2. 武汉大学电子信息学院,湖北,武汉,430079 |
| |
| 摘 要： | 随着互联网的广泛应用，网络服务质量(QoS)保证技术显得越来越重要，为了保证网络服务质量，希望根据多个QoS约束参数来选择可行路由。一般说来，多受限路径优化问题是一个NP完全问题，因此在多项式时间复杂度里不能解决该问题，针对这个问题，在启发式算法的基础上，提出一种改进扩展Bellman-Ford最短路径算法(MEBF)，将NP完全问题简化为在多项式时间复杂度里能解决的问题。模拟的结果表明，该算法有良好的运行效率和QoS路由成功率。
|
| 关 键 词： | QoS路由 启发式算法 网络服务质量保证技术 MEBF算法 MCOP问题 模拟 |
| 文章编号： | 1000-7024(2004)04-0569-03 |
Research on heuristic algorithm in multi-constraints QoS routing |
| |
| ZHU Wen-qi,ZHANG De-xiang,CHEN Ya-lin.Research on heuristic algorithm in multi-constraints QoS routing[J].Computer Engineering and Design,2004,25(4):569-571,578. |
| |
| Authors: | ZHU Wen-qi ZHANG De-xiang CHEN Ya-lin |
| |
| Abstract: | With the wider application based on the web technology, the guarantee technology of QoS gets more and more important. In order to realize the QoS, the alternate routing is applicable according to several QoS parameters with constraints. In general, the optimal routing problem with multiple constraints is a non-polynomial complete (NP-C) problem. Therefore, the problem can not be solved in the polynomial time based on the degree of complexity. Pointing to the problem an improving algorithm with modified extending Bellman-Ford was provided on the base of heuristic algorithm. Furthermore, the NP-C problem would be simplified and might be solved in polynomial time. The simulation results show that the algorithm is well efficient and rather potent. |
| |
| Keywords: | QoS routing heuristic algorithm MEBP algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
