Skip to main content

Optimal routing with failure−independent path protection

Thomas Stidsen‚ Bjørn Petersen‚ Simon Spoorendonk‚ Martin Zachariasen and Kasper Bonne Rasmussen


Reliable communication has become crucial in today's information society. Modern communication networks are required to deliver reliable communication to their customers. Unfortunately, protection against network failures significantly hampers efficient utilization of network investments, because the associated routing problems become much harder. In this article we present a rigorous mathematical analysis of one of the most promising protection methods: Failure independent path protection. We present an LP model which is solved by column generation. The subproblem is proven to be strongly \cal NP-hard, but still solvable for medium sized networks through the use of specialized dynamic programming algorithms. This enables us to evaluate the performance of failure independent path protection for eight networks with up to 37 nodes and 57 links. The results indicate that only between 3% and 8% extra network capacity is necessary when compared with the capacity required by complete rerouting (which is the absolute lower bound for single link failure protection). © 2009 Wiley Periodicals, Inc. NETWORKS, 2010