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