Different algorithms for normal and protection paths

Many network routing situations commonly require backup paths that satisfy various constraints on bandwidth, link or node selection, and ease of configuration. In this paper, we attempt to validate whether it is beneficial to have distinct algorithmic treatments of normal and backup path calculation, configuration and maintenance. We present a modular suite of algorithms that enable us to manage normal and protection paths differently. We incorporate a distributed algorithm to separately calculate normal and backup paths in the network, using link state information, and present an evaluation of asynchronous dynamic reorganization of backup paths to reduce congestion in the network. Simulations demonstrate quantitative reductions in blocking probabilities under certain conditions. We conclude that in order to choose an optimal algorithm for a protected QoS routing application, it is recommended to also consider a combination of two different algorithms for normal and backup paths.