Link-disjoint paths for reliable QoS routing

被引：60

作者：

Guo, YC

Kuipers, F

Van Mieghem, P

机构：

[1] Delft Univ Technol, Fac Elect Engn Math & Comp Sci, NL-2600 GA Delft, Netherlands

[2] No Jiaotong Univ, Sch Elect & Informat Engn, Beijing 100044, Peoples R China

来源：

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS | 2003年 / 16卷 / 09期

关键词：

QoS routing link-disjoint paths; restorable/reliable routing;

D O I：

10.1002/dac.612

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

The problem of finding link/node-disjoint paths between a pair of nodes in a network has received much attention in the past. This problem is fairly well understood when the links in a network are only specified by a single link weight. However, in the context of quality of service routing, links are specified by multiple link weights and restricted by multiple constraints. Unfortunately, the problem of finding link/node disjoint paths in multiple dimensions faces different conceptual problems. This paper presents a first step to understanding these conceptual problems in link-disjoint quality of service routing and proposes a heuristic link-disjoint QoS algorithm that circumvents these problems. Copyright (C) 2003 John Wiley Sons, Ltd.

引用

页码：779 / 798

页数：20