|
|||||
|
|
| 多约束分离路径算法 | |
| 引用本文： | 郭宇春,Piet Van Mighem,陈常嘉. 多约束分离路径算法[J]. 铁道学报, 2005, 27(2): 49-57 |
| 作者姓名： | 郭宇春 Piet Van Mighem 陈常嘉 |
| 作者单位： | 1. 北京交通大学,电子信息工程学院,北京,100044 2. 荷兰代尔夫特大学,电子工程数学与计算机科学学院 |
| 基金项目： | 国家留学基金委Nuffic奖学金(20811114);国家自然科学基金项目(60132030)及(60202001) |
| 摘 要： | 多媒体流和视讯会议等新应用的出现要求网络提供可靠的服务质量(QoS)保证。为网络中的每对节点建立两条多约束链路/节点分离路由是提供可靠QoS的一条重要途径。如何建立两条链路/节点分离多约束路径是一个关键问题,这一问题与经典的一维测度下的分离路径问题有着很多概念上的不同。本文分析了这一问题的困难性,并提出一组解决此问题的启发式算法。 |
| 关 键 词： | 可靠QoS路由 分离路径 多约束路径 |
| 文章编号： | 1001-8360(2005)02-0049-09 |
| 修稿时间： | 2004-03-05 |
Disjoint Multiple-constrained Paths Algorithms |
|
| GUO Yu-chun,Fernando Kuipers,Piet Van Mighem,CHEN Chang-jia. Disjoint Multiple-constrained Paths Algorithms[J]. Journal of the China railway Society, 2005, 27(2): 49-57 | |
| Authors: | GUO Yu-chun Fernando Kuipers Piet Van Mighem CHEN Chang-jia |
| Affiliation: | GUO Yu-chun~1,Fernando Kuipers~2,Piet Van Mighem~2,CHEN Chang-jia~1 |
| Abstract: | Networks are expected to provide reliable quality of service (QoS) imposed by new applications such as multimedia streaming and video conferencing. Using two link/node-disjoint paths between a pair of nodes in a network is a common approach to provide reliable QoS. The problem of finding link/node disjoint paths satisfying multiple constraints is a major issue in this context. This problem faces many different concepts compared with the classical one-dimension disjoint paths problem. This paper addresses these conceptual problems and presents some heuristics for solving this problem. |
| Keywords: | reliable QoS routing disjoint paths multiple-constrained paths |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |