Stability issues in OSPF routing
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Analysis of link failures in an IP backbone
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Achieving sub-second IGP convergence in large IP networks
ACM SIGCOMM Computer Communication Review
Achieving sub-50 milliseconds recovery upon BGP peering link failures
CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
An evaluation of IP-based fast reroute techniques
CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
Simplifying the synthesis of internet traffic matrices
ACM SIGCOMM Computer Communication Review
Providing public intradomain traffic matrices to the research community
ACM SIGCOMM Computer Communication Review
Fast local rerouting for handling transient link failures
IEEE/ACM Transactions on Networking (TON)
Achieving convergence-free routing using failure-carrying packets
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
IP fast reroute with failure inferencing
Proceedings of the 2007 SIGCOMM workshop on Internet network management
Improving service differentiation in IP networks through dual topology routing
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
On improving the efficiency and manageability of NotVia
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Relaxed multiple routing configurations: IP fast reroute for single and correlated failures
IEEE Transactions on Network and Service Management
A survey of resilience differentiation frameworks in communication networks
IEEE Communications Surveys & Tutorials
IP resilience within an autonomous system: current approaches, challenges, and future directions
IEEE Communications Magazine
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the feasibility and efficacy of protection routing in IP networks
IEEE/ACM Transactions on Networking (TON)
Selecting shorter alternate paths for tunnel-based IP Fast ReRoute in linear time
Computer Networks: The International Journal of Computer and Telecommunications Networking
Effectiveness of link cost optimization for IP rerouting and IP fast reroute
MMB&DFT'10 Proceedings of the 15th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
Handling transient link failures using alternate next hop counters
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
Optimizing IGP link costs for improving IP-level resilience with Loop-Free Alternates
Computer Communications
| Hi-index | 0.02 |
The IETF currently discusses fast reroute mechanisms for IP networks (IP FRR). IP FRR accelerates the recovery in case of network element failures and avoids micro-loops during re-convergence. Several mechanisms are proposed. Loop-free alternates (LFAs) are simple but cannot cover all single link and node failures. Not-via addresses can protect against these failures but are more complex, in particular, they use tunneling techniques to deviate backup traffic. In the IETF it has been proposed to combine both mechanisms to merge their advantages: simplicity and full failure coverage. This work analyzes LFAs and classifies them according to their abilities. We qualitatively compare LFAs and not-via addresses and develop a concept for their combined application to achieve 100% single failure coverage, while using simple LFAs wherever possible. The applicability of existing LFAs depends on the resilience requirements of the network. We study the backup path length and the link utilization for both IP FRR methods and quantify the decapsulation load and the increase of the routing table size caused by not-via addresses. We conclude that the combined usage of both methods has no advantage compared to the application of not-via addresses only.