 |
|
|
|
 |
 |
 |
|
 |
|
 |
|
|
| 华宇,吴产乐,王勇.GMPLS网络中多约束QoS路由的预计算方法.软件学报,2006,17(1):167-174 |
| GMPLS网络中多约束QoS路由的预计算方法 |
| Precomputation for Multi-Constrained QoS Routing in GMPLS Networks |
| 投稿时间：2003-11-25 修订日期：2005-07-08 |
| DOI： |
| 中文关键词: QoS路由 预计算 通用的多协议标记交换 层次化网络 NP完全 |
| 英文关键词:QoS routing precomputation GMPLS hierarchical networks NP-complete |
| 基金项目:Supported by the National High-Tech Research and Development Plan of China under Grant No.2003AA001032(国家高技术研究发展计划(863));the National Key Laboratoryin Software Engineering of Wuhan University under Grant No.SKLSE03-14(软件工程国家重点实验室开放基金)；the Natural Science |
| 作者 | 单位 | | 华宇 | 武汉大学,计算机学院,湖北,武汉,430079 | | 吴产乐 | 武汉大学,计算机学院,湖北,武汉,430079 | | 王勇 | 朗讯科技,贝尔实验室中国基础科学研究院,北京,100080 |
|
| 摘要点击次数: 3390 |
| 全文下载次数: 2922 |
| 中文摘要: |
| GMPLS(generalized multiprotocol label SWitching)网络中的多约束QoS路由问题是要在诸如带宽、代价和延迟的约束条件下找到一条优化的路径.这个问题通常被认为是一个NP-完全问题.在研究共享风险链路组具有的启发信息的基础上,提出了一种具有共享风险链路启发信息的多约束预计算算法.该算法包含预计算和搜索两个部分.预计算主要是能创建和更新每个节点上的路由表.而后,搜索部分则可以在层次化的结构中选择满足约束条件的优化的路径.大量仿真数据表明,相应的方法能够取得满意的结果,可以有效地解决GMPLS网络中多约束的QoS路由问题. |
| 英文摘要: |
| Multi-Constrained QoS routing in GMPLS (generalized multiprotocol label switching) network is to find an optimal path satisfying several constraints, such as bandwidth, cost and delay. The problem has been considered as a NP-Complete problem. Based on SRLG heuristic information, the paper provides a MPAS algorithm (Multi-constrained Precomputation Algorithm with SRLG), which includes the precomputation and searching procedures. The precomputation i s able to create and update the routing tables in each node. Then, the searching procedure can select an optimal path satisfying several constraints in the hierarchical architecture. The results of extensive simulation based on the self-similar traffic show that the corresponding methods can achieve satisfactory performance and efficiently solve the problem of multi -constrained QoS routing in GMPLS network. |
|
HTML 下载PDF全文 查看/发表评论 下载PDF阅读器 |
|
|
|
|
|
|
 |
|
|
|
|
 |
|
 |
|
 |
|
