On the Feasibility and Efficacy of Protection Routing in IP Networks

  title={On the Feasibility and Efficacy of Protection Routing in IP Networks},
  author={Kin Wah Kwong and Lixin Gao and Roch Gu{\'e}rin and Zhi-Li Zhang},
With network components increasingly reliable, routing is playing an ever greater role in determining network reliability. This has spurred much activity in improving routing stability and reaction to failures, and rekindled interest in centralized routing solutions, at least within a single routing domain. Centralizing decisions eliminates uncertainty and many inconsistencies, and offers added flexibility in computing routes that meet different criteria. However, it also introduces new… 
Optimization methods for improving IP-level fast protection for local shared risk groups with Loop-Free Alternates
The main contributions of the paper are a novel extension of the bipartite graph model for the LFA graph extension problem to the multiple-failure case using the model of Shared Risk Groups, and a suite of accompanying heuristics to obtain approximate solutions.
Reliability Assessment for Wireless Mesh Networks Under Probabilistic Region Failure Model
This paper develops a grid-partition-based scheme to estimate the expected flow capacity degradation from a random region failure and establishes a theoretical framework to determine a suitable grid partition such that a specified estimation error requirement is satisfied.


Message-efficient dissemination for loop-free centralized routing
When and why avoiding transient loops might require a significant number of messages in a centralized routing system is identified, and it is established that minimizing the number of required messages is NP-hard, and a greedy heuristic is proposed that shows to perform well under many conditions.
Fast IP Network Recovery Using Multiple Routing Configurations
This paper presents a new recovery scheme called Multiple Routing Configurations (MRC), based on keeping additional routing information in the routers, and allows packet forwarding to continue on an alternative output link immediately after the detection of a failure.
The case for separating routing from routers
This work presents a design overview of RCP based on three architectural principles path computation based on a consistent view of network state, controlled interactions between routing protocol layers, and expressive specification of routing policies and discusses the architectural strengths and weaknesses of the proposal.
Improving service differentiation in IP networks through dual topology routing
The paper's contributions are in demonstrating and quantifying the benefits that the added flexibility of different (dual) routing affords, and in developing an efficient heuristic for computing jointly optimal routing solutions.
Failure Inferencing Based Fast Rerouting for Handling Transient Link and Node Failures
This paper extends the FIFR approach to ensure loop-free packet delivery in case of single router failures also, thus mitigating the impact of many scenarios of failures and demonstrating that the proposed approach not only provides high service availability but also incurs minimal routing overhead.
Achieving convergence-free routing using failure-carrying packets
This work proposes a technique called Failure-Carrying Packets (FCP), a technique that allows data packets to autonomously discover a working path without requiring completely up-to-date state in routers, and shows that it provides better routing guarantees under failures despite maintaining lesser state at the routers.
Improving the resilience in IP networks
It is shownHow multipath route sets can be found in reasonably meshed networks and how multipath routing can be used to save on the spare capacity required in case of link failures.
Two routing algorithms for failure protection in IP networks
Two new routing algorithms are presented which provide at each node two or more next hops towards every destination, so that nodes can react quickly without further signaling to link or node failures.
IGP link weight assignment for operational Tier-1 backbones
A Tabu-search heuristic for choosing link weights that takes into account both service-level agreement (SLA) requirements and link failures is proposed and it is found that performance under transient failures can be dramatically improved at the expense of a small degradation during normal network operation.
Always Acyclic Distributed Path Computation
A new algorithm, Distributed Path Computation with Intermediate Variables (DIV), which can be combined with any distributed routing algorithm to guarantee that the directed graph induced by the routing decisions remains acyclic at all times.