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
Proceedings Article
Blink: Fast Connectivity Recovery Entirely in the Data Plane
Thomas Holterbach,Edgar Costa Molero,Maria Apostolaki,Alberto Dainotti,Stefano Vissicchio,Laurent Vanbever +5 more
TL;DR: An implementation of Blink in P4 together with an extensive evaluation on real and synthetic traffic traces indicate that Blink achieves sub-second rerouting for large fractions of Internet traffic and prevents unnecessary traffic shifts even in the presence of noise.
Journal ArticleDOI
On the spanning tree packing number of a graph: a survey
TL;DR: This work uses an observation of Paul Catlin to investigate the STP numbers of several families of graphs including quasi-random graphs, regular graphs, complete bipartite graphs, cartesian products and the hypercubes.
Proceedings ArticleDOI
Network resilience through multi-topology routing
Michael Menth,Rüdiger Martin +1 more
TL;DR: The proposed multi-topology (MT) routing is still a pure IP-based solution that retains the scalability and the robustness of IP routing, and can be compared to fast rerouting mechanisms in MPLS, which reduce packet drops to a minimum.
Proceedings ArticleDOI
Failure inferencing based fast rerouting for handling transient link and node failures
TL;DR: 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.
Proceedings ArticleDOI
Auto-discovery of shared risk link groups
TL;DR: In this article, location-based techniques for the automatic discovery of shared risk link groups (SRLGs) in transport networks, which are fundamental inputs for failure risk management are proposed.