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 ArticleDOI
Brief announcement: on the resilience of routing tables
TL;DR: This work begins the theoretical study of resilient routing tables, which incorporate "failover" paths into routers' forwarding tables and are used in many modern network designs.
Proceedings ArticleDOI
On the Resiliency of Randomized Routing Against Multiple Edge Failures
Marco Chiesa,Andrei Gurtov,Aleksander Madry,Slobodan Mitrovic,Ilya Nikolaevskiy,Michael Shapira,Scott Shenker +6 more
TL;DR: In this article, the authors study the Static-Routing-Resiliency problem, motivated by routing on the Internet, and propose a randomized routing algorithm that has expected number of hops O(|V|k) if at most k-1 edges fail, which reduces to O(V|) if only a fraction t of the links fail.
Proceedings ArticleDOI
Reliable and fast rerouting mechanism for a protected label switched path
TL;DR: A reliable, fast and efficient mechanism for rerouting traffic when there is a link/node failure or congestion problem in multiprotocol label switching (MPLS) networks, able to guarantee rigorous QoS criteria for high-priority data traffic by eliminating packet loss and disorder, and minimizing packet delay.
Proceedings ArticleDOI
IP fast rerouting for multi-link failures
TL;DR: An IP fast reroute mechanism using rooted arc-disjoint spanning trees that guarantees recovery from (k-1) link failures in a k-edge-connected network and reduces path stretch in comparison with previously known techniques is developed.
Proceedings ArticleDOI
Automatic fault detection and recovery in real time switched Ethernet networks
TL;DR: The heart of EtheReal's fault detection and recovery mechanism is a fast spanning tree reconfiguration algorithm to reduce the total fault recovery time, and a delayed link inactivation scheme that allows real-time connections which are not affected by the failed links/switches to continue to exist, even though some of the links are marked as "blocked" in the new spanning tree topology.