| 启发式多约束路由算法研究 |
| |
| 引用本文： | 胡永良.启发式多约束路由算法研究[J].计算机工程与应用,2005,41(30):155-157. |
| |
| 作者姓名： | 胡永良 |
| |
| 作者单位： | 台州学院信息与电子工程学院,浙江临海317000 |
| |
| 基金项目： | 浙江省自然科学基金（编号：603009） |
| |
| 摘 要： | 作为下一代互联网的核心问题之一,服务质量路由(QOSR)用来寻找一条同时满足多个约束条件的可行路径。多约束路由算法具有NPC的复杂度,研究者一般通过启发式算法来求近似解。对当前提出的各种单播启发式多约束路由算法进行了分析、比较,总结了各种算法的特点。最后指出了该领域需要进一步研究的热点问题。
|
| 关 键 词： | 服务质量路由 多约束路由 NP完全问题 启发式算法 |
| 文章编号： | 1002-8331-（2005）30-0155-03 |
| 收稿时间： | 2005-01 |
| 修稿时间： | 2005-01 |
Research on Heuristic Multi-constrained Routing Algorithms |
| |
| Hu Yongliang.Research on Heuristic Multi-constrained Routing Algorithms[J].Computer Engineering and Applications,2005,41(30):155-157. |
| |
| Authors: | Hu Yongliang |
| |
| Affiliation: | College of Information and Electronic Engineering,Taizhou University, Linhai, Zhejiang 317000 |
| |
| Abstract: | QOSR(QOS Routing) is one of the key issues for next-generation networks,which seeks to find a feasible with multiple constraints.This problem have the complexity of NPC(NP c-omplete),at generately,researchers design heuristic algorithms to gaining approximately solution.In this article,after typical heuristic algorithms on unicast multi-constrained routing are analyzed,the comparison and summary are given.At last,some key issues are pointed out to be further studied in the QOSR field. |
| |
| Keywords: | service of quality routing muhi-constrained routing NP complete problem heurlstic algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
