A Survey of Fast Recovery Mechanisms in the Data Plane
Reads0
Chats0
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
Optimizing IGP link costs for improving IP-level resilience with Loop-Free Alternates
TL;DR: This paper gives a new graph theoretical framework for analyzing LFA failure case coverage, and investigates how to optimize the Interior Gateway Protocol (IGP) link costs in order to maximize the number of protected failure scenarios.
Journal ArticleDOI
Local restoration with multiple spanning trees in metro ethernet networks
TL;DR: This paper proposes a local restoration mechanism for Metro Ethernet, which is distributed, fast, and does not need failure notification, and proposes two approaches for backup tree selection (connection based and destination based), and formulate the working spanning tree assignment and backup spanning tree configuration problem as an integer linear programming problem.
Proceedings ArticleDOI
Improved Fast Rerouting Using Postprocessing
TL;DR: This paper presents an algorithmic framework for improving a given FRR network decomposition, using postprocessing, based on iterative arc swapping strategies and supports a number of use cases, from strengthening the resilience to improving the quality of the resulting routes.
Journal ArticleDOI
Fast reroute paths algorithms
TL;DR: This paper investigates the algorithmic aspects of computing original paths along with their back-up so that they satisfy quality-of-service constraints for single link or multiple link failure and proposes an algorithm in O(nm+n2log(n)) that computes shortest guaranteed paths with their backup towards a single destination.
Delay Limits for Real-Time Services
Mirko Suznjevic,Jose Saldana +1 more
TL;DR: This document surveys a set of recommendations about the maximum latency tolerated by the users of delay-constrained services, and a summary of the latency limits for each service is finally provided.