Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published June 2005 | Published
Journal Article Open

Algorithms for Computing QoS Paths With Restoration

Abstract

There is a growing interest among service providers to offer new services with Quality of Service (QoS) guarantees that are also resilient to failures. Supporting QoS connections requires the existence of a routing mechanism, that computes the QoS paths, i.e., paths that satisfy QoS constraints (e.g., delay or bandwidth). Resilience to failures, on the other hand, is achieved by providing, for each primary QoS path, a set of alternative QoS paths used upon a failure of either a link or a node. The above objectives, coupled with the need to minimize the global use of network resources, imply that the cost of both the primary path and the restoration topology should be a major consideration of the routing process. We undertake a comprehensive study of problems related to finding suitable restoration topologies for QoS paths. We consider both bottleneck QoS constraints, such as bandwidth, and additive QoS constraints, such as delay and jitter. This is the first study to provide a rigorous solution, with proven guarantees, to the combined problem of computing QoS paths with restoration. It turns out that the widely used approach of disjoint primary and restoration paths is not an optimal strategy. Hence, the proposed algorithms construct a restoration topology, i.e., a set of bridges, each bridge protecting a portion of the primary QoS path. This approach guarantees to find a restoration topology with low cost when one exists.

Additional Information

© 2005 IEEE. Manuscript received February 20, 2003; revised April 21, 2004; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor Z. Zhang.

Attached Files

Published - 01458771.pdf

Files

01458771.pdf
Files (748.5 kB)
Name Size Download all
md5:d175eba1569de5a65bc2a8eac7a04914
748.5 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 18, 2023