Inferring link weights using end-to-end measurements
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems
INFORMS Journal on Computing
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Routing, Flow, and Capacity Design in Communication and Computer Networks
Routing, Flow, and Capacity Design in Communication and Computer Networks
Achieving sub-second IGP convergence in large IP networks
ACM SIGCOMM Computer Communication Review
An evaluation of IP-based fast reroute techniques
CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
On improving the efficiency and manageability of NotVia
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Multiple routing configurations for fast IP network recovery
IEEE/ACM Transactions on Networking (TON)
SafeGuard: safe forwarding during route changes
Proceedings of the 5th international conference on Emerging networking experiments and technologies
A novel loop-free IP fast reroute algorithm
EUNICE'07 Proceedings of the 13th open European summer school and IFIP TC6.6 conference on Dependable and adaptable networks and services
Loop-free alternates and not-via addresses: A proper combination for IP fast reroute?
Computer Networks: The International Journal of Computer and Telecommunications Networking
Traffic engineering with traditional IP routing protocols
IEEE Communications Magazine
Editorial: Reliable network-based services
Computer Communications
Hi-index | 0.24 |
The IP Fast ReRoute-Loop-Free Alternates (LFA) standard is a simple and easily deployable technique to provide fast failure protection right in the IP layer. To our days, most major IP device vendors have products on the market that support LFA out of the box. Unfortunately, LFA usually cannot protect all possible failure scenarios in a general network topology. Therefore, it is crucial to develop LFA-based network optimization tools in order to assist operators in deciding whether deploying LFA in their network will supply sufficient resiliency. In this paper, we give a new graph theoretical framework for analyzing LFA failure case coverage, and then we investigate how to optimize the Interior Gateway Protocol (IGP) link costs in order to maximize the number of protected failure scenarios. We show that this problem is NP-complete even in a very restricted formulation, and we give an exact algorithm as well as a complete family of heuristics to solve it. Our simulation studies indicate that a deliberate tuning of the approximation strategy can significantly improve the quality of the IGP link costs, and we conclude that LFA cost optimization has the potential for boosting LFA-based resilience in most operational networks significantly.