Different Algorithms for Normal and Protection Paths

Author： Gupta Rajarshi Chi Eric Walrand Jean

ISSN： 1064-7570

Source： Journal of Network and Systems Management, Vol.13, Iss.1, 2005-03, pp. : 13-33

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

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. In the process, we develop a simple extension of Minimum Interference Routing Algorithm for shared protection paths. 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 nontrivial 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.