Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
NOSSDAV '02 Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Network Recovery: Protection and Restoration of Optical, SONET-SDH, IP, and MPLS
Network Recovery: Protection and Restoration of Optical, SONET-SDH, IP, and MPLS
The Complete Is-is Routing Protocol
The Complete Is-is Routing Protocol
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
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
REPLEX: dynamic traffic engineering based on wardrop routing policies
CoNEXT '06 Proceedings of the 2006 ACM CoNEXT conference
Towards Robust Multi-Layer Traffic Engineering: Optimization of Congestion Control and Routing
IEEE Journal on Selected Areas in Communications
Feasibility of IP restoration in a tier 1 backbone
IEEE Network: The Magazine of Global Internetworking
IP Fast ReRoute: Lightweight Not-Via
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
Loop-free alternates and not-via addresses: A proper combination for IP fast reroute?
Computer Networks: The International Journal of Computer and Telecommunications Networking
R3: resilient routing reconfiguration
Proceedings of the ACM SIGCOMM 2010 conference
Fast recovery from dual-link or single-node failures in IP networks using tunneling
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
Handling transient link failures using alternate next hop counters
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
IP fast reroute in networks with shared risk links
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
Minimum Protection Cost Tree: A tunnel-based IP Fast Reroute Scheme
Computer Communications
An efficient critical protection scheme for intra-domain routing using link characteristics
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimizing IGP link costs for improving IP-level resilience with Loop-Free Alternates
Computer Communications
| Hi-index | 0.00 |
This paper presents techniques that improve the efficiency and manageability of an IP Fast Reroute (IPFRR) technology: NotVia. NotVia provides the IPFRR service for all destinations in an ISP's network upon any single link or node failure, while previous proposals such as Loop-free Alternates (LFA) can not guarantee this level of coverage. However, NotVia increases the computational and memory costs of the IPFRR service, and poses new challenges to network management, as routers are unaware of the links and nodes (hence the amount of traffic) that they actually protect. This paper introduces three techniques: NotVia aggregation, prioritized NotVia computation, and the rNotVia algorithm that collectively reduce the overhead of NotVia and improve its manageability. We use simulations to evaluate these techniques on real ISP topologies as well as on randomly generated topologies. The results show that the computational and memory overhead of NotVia are reduced to a fraction of their previous values on various topologies, suggesting that the techniques proposed in this paper make NotVia a more efficient and easy-to-manage IPFRR solution.