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
Recovery (Protection and Restoration) Terminology for Generalized Multi-Protocol Label Switching (GMPLS)
TL;DR: This document defines a common terminology for Generalized Multi- Protocol Label Switching-based recovery mechanisms (i.e., protection and restoration) independent of the underlying transport technologies covered by GMPLS.
Proceedings ArticleDOI
FlowBender: Flow-level Adaptive Routing for Improved Latency and Throughput in Datacenter Networks
TL;DR: This work proposes FlowBender, a novel technique that Load balances distributively at the granularity of flows instead of packets, avoiding excessive packet reordering and improves average and tail latencies significantly compared to state of the art techniques without incurring the significant overhead and complexity of other load balancing schemes.
Journal ArticleDOI
Engineering end-to-end IP resilience using resilience-differentiated QoS
A. Autenrieth,Andreas Kirstädter +1 more
TL;DR: In this article an extension to existing quality of service (QoS) architectures is presented that integrates the signaling of resilience requirements with the traditional QoS signaling and is referred to as resilience-differentiated QoS (RD-QoS).
Proceedings ArticleDOI
On failure detection algorithms in overlay networks
TL;DR: It is found that among the class of keep-alive algorithms that share information, the maintenance of backpointer state substantially improves detection time and packet loss rate and sharing of information allows a network to tolerate a higher churn rate than baseline.
Book
Resilient Routing in Communication Networks
TL;DR: This paper presents a meta-modelling framework for estimating the resilience of wireless mesh networks to disruption-tolerant routing in Vehicular Ad-hoc Networks and some of the mechanisms that control their resilience.