A Survey of Fast Recovery Mechanisms in the Data Plane
TLDR
This survey presents a systematic, tutorial-like overview of packet-based fast-recovery mechanisms in the data plane, focusing on concepts but structured around different networking technologies, from traditional link-layer and IP-based mechanisms, over BGP and MPLS to emerging software-defined networks and programmable data planes.Abstract:
In order to meet their stringent dependability requirements, most modern communication networks support fast-recovery mechanisms in the data plane. While reactions to failures in the data plane can be significantly faster compared to control plane mechanisms, implementing fast recovery in the data plane is challenging, and has recently received much attention in the literature. This survey presents a systematic, tutorial-like overview of packet-based fast-recovery mechanisms in the data plane, focusing on concepts but structured around different networking technologies, from traditional link-layer and IP-based mechanisms, over BGP and MPLS to emerging software-defined networks and programmable data planes. We examine the evolution of fast-recovery standards and mechanisms over time, and identify and discuss the fundamental principles and algorithms underlying different mechanisms. We then present a taxonomy of the state of the art and compile open research questions.read more
Citations
More filters
Journal ArticleDOI
Fast ReRoute on Programmable Switches
Marco Chiesa,Roshan Sedar,Gianni Antichi,Michael Borokhovich,Andrzej Kamisinski,Georgios Nikolaidis,Stefan Schmid +6 more
TL;DR: In this article, a Fast Re-Routing (FRR) primitive for programmable data planes, PURR, is proposed, which provides low failover latency and high switch throughput, by avoiding packet recirculation.
Posted Content
On the Feasibility of Perfect Resilience with Local Fast Failover
TL;DR: It is proved that it is impossible to achieve perfect resilience on any non-planar graph, and it is shown that graph families which are closed under the subdivision of links, can allow for simple and efficient failover algorithms which simply skip failed links.
Proceedings ArticleDOI
Grafting Arborescences for Extra Resilience of Fast Rerouting Schemes
TL;DR: In this article, the authors present several fast rerouting algorithms which are not limited by spanning trees, but rather extend and combine multiple spanning arborescences to improve resilience.
Journal ArticleDOI
Enhanced Bit Repair IP Fast Reroute Mechanism for Rapid Network Recovery
TL;DR: The paper presents the proposal of the new Enhanced Bit Repair (EB-REP)IP FRR mechanism, which offers significant improvements over its predecessor, the B-REP mechanism, and is an advanced contribution to solving IP FRR-related problems.
Book ChapterDOI
Research of the QoE Fast ReRouting Processes with Differentiated R-Factor Maximization for VoIP-Flows Using the Tensor Model of the Corporate Telecommunication Network
TL;DR: In this paper, a flow-based model of QoE Fast ReRouting is proposed, which is based on the implementation of the single path or multipath routing, the conditions of flow conservation, which are introduced for routing variables that regulate the construction of both primary and backup paths.
References
More filters
Journal ArticleDOI
Achieving sub-50 milliseconds recovery upon BGP peering link failures
TL;DR: This work proposes a new fast-reroute technique where routers are prepared to react quickly to interdomain link failures and shows that transient forwarding loops can be avoided during the routing convergence that follows the deactivation of a protection tunnel in BGP/MPLS VPNs and in IP networks using encapsulation.
Proceedings ArticleDOI
A case study of OSPF behavior in a large enterprise network
TL;DR: A case study on the eharacteristics and dynamics of LSA traffic for a large enterprise network, which consists of several hundred routers, distributed in tens of OSPF areas, and connected by LANs and private lines.
Proceedings ArticleDOI
Limiting path exploration in BGP
TL;DR: This paper describes why path exploration cannot be countered effectively within the existing BGP framework, and proposes a simple, novel mechanism - forward edge sequence numbers - to annotate the AS paths with additional "path dependency" information.
IP Fast Reroute using tunnels
TL;DR: In this paper, the authors describe an IP fast re-route mechanism that provides backup connectivity in the event of a link or router failure, in the absence of single points of failure and asymmetric costs.
Proceedings ArticleDOI
Evaluation of IP Fast Reroute Proposals
TL;DR: A comprehensive analysis of a number of IP fast reroute mechanisms developed by the IETF by evaluating their coverage for a variety of inferred and synthetic ISP topologies is presented.