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
Ingress Filtering for Multihomed Networks
Fred Baker,P. Savola +1 more
TL;DR: This document describes the current ingress filtering operational mechanisms, examines generic issues related to inggress filtering, and delves into the effects on multihoming in particular.
Journal ArticleDOI
Pan-European optical transport networks: An availability-based comparison
Sophie De Maesschalck,Didier Colle,Ilse Lievens,Mario Pickavet,Piet Demeester,Christian Mauz,Monika Jaeger,R. Inkret,Branko Mikac,Jan Derkacz +9 more
TL;DR: In this paper, some network topologies for such a pan-European fiber-optic backbone network are presented and a distinction is made between different recovery options in the optical layer for the different traffic types considered.
Proceedings ArticleDOI
Dynamic routing of locally restorable bandwidth guaranteed tunnels using aggregated link usage information
Murali Kodialam,T. V. Lakshman +1 more
TL;DR: A new algorithm is developed which only uses aggregated link usage information that is easily obtainable by proposed routing protocol extensions and performs well in terms of the number of rejected requests and the total bandwidth used.
Journal ArticleDOI
OpenFlow: Meeting carrier-grade recovery requirements
TL;DR: This paper adds the recovery action in the switches themselves so that the switches can do recovery without contacting the controller, and shows that this approach can achieve recovery within 50ms in a large-scale network serving many flows.
Journal ArticleDOI
Evaluation of network resilience, survivability, and disruption tolerance: analysis, topology generation, simulation, and experimentation
James P. G. Sterbenz,Egemen K. Çetinkaya,Mahmood A. Hameed,Abdul Jabbar,Shi Qian,Justin P. Rohrer +5 more
TL;DR: A comprehensive methodology to evaluate network resilience using a combination of topology generation, analytical, simulation, and experimental emulation techniques with the goal of improving the resilience and survivability of the Future Internet.