We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
Link-disjoint paths for reliable QoS routing.
- Authors
Yuchun Guo; Kuipers, Fernando; Van Mieghem, Piet
- Abstract
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.
- Subjects
LINK theory; ALGORITHMS; HEURISTIC programming; NETWORK performance; TELECOMMUNICATION
- Publication
International Journal of Communication Systems, 2003, Vol 16, Issue 9, p779
- ISSN
1074-5351
- Publication type
Article
- DOI
10.1002/dac.612