Link-disjoint paths for reliable QoS routing

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 ar...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of communication systems Vol. 16; no. 9; pp. 779 - 798
Main Authors Guo, Yuchun, Kuipers, Fernando, Van Mieghem, Piet
Format Journal Article
LanguageEnglish
Published Chichester, UK John Wiley & Sons, Ltd 01.11.2003
Subjects
Algorithms
Communication systems
Computer networks
Heuristic
link-disjoint paths
Links
Networks
QoS routing
restorable/reliable routing
Routing (telecommunications)
Online AccessGet full text

Cover

More Information
Summary: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 © 2003 John Wiley & Sons, Ltd.
Bibliography:NUFFIC
ark:/67375/WNG-TFH2B5PH-T
istex:A55CB3024B481B071FEEB1B99F913CED0E42066E
ArticleID:DAC612
ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1074-5351
1099-1131
DOI:10.1002/dac.612