Optimal Routing with Failure-Independent Path Protection

Thomas Riis Stidsen, Bjørn Petersen, Simon Spoorendonk, Martin Zachariasen, Kasper Bonne Rasmussen

    Research output: Contribution to journalJournal articleResearchpeer-review

    Abstract

    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 P-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).
    Original languageEnglish
    JournalNetworks (New York)
    Volume55
    Issue number2
    Pages (from-to)125-137
    ISSN0028-3045
    DOIs
    Publication statusPublished - 2010

    Cite this

    Stidsen, T. R., Petersen, B., Spoorendonk, S., Zachariasen, M., & Rasmussen, K. B. (2010). Optimal Routing with Failure-Independent Path Protection. Networks (New York), 55(2), 125-137. https://doi.org/10.1002/net.20323