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
Proceedings ArticleDOI
IP fast reroute with remote Loop-Free Alternates: The unit link cost case
Levente Csikor,Gábor Rétvári +1 more
TL;DR: Preliminary numerical evaluations conducted on real IP network topologies suggest that rLFA significantly improves the level of protection, and most networks need only 2 - 3 new links to be added to attain 100% failure case coverage.
Journal ArticleDOI
On providing fast protection with remote loop-free alternates
Levente Csikor,Gábor Rétvári +1 more
TL;DR: Preliminary numerical evaluations conducted on real IP network topologies suggest that rLFA significantly improves the level of protection, and most networks need only 2–3 new links to be added to attain 100 % failure case coverage irrespectively of whether link or node protection is considered.
Proceedings ArticleDOI
Multipath routing and dual link failure recovery in IP networks using three link-independent trees
TL;DR: An approach for disjoint multipath routing and fast recovery in IP networks that guarantees recovery from arbitrary two link failures and compares the path lengths provided under single and dual link failures with an earlier approach based on tunneling.
Proceedings ArticleDOI
Fast Spanning Tree Reconnection for Resilient Metro Ethernet Networks
TL;DR: The optimization results show that with lower implementation cost, fast spanning tree reconnection mechanism can achieve comparative or considerably better performance than other resilient mechanisms for Metro Ethernet networks.
Book ChapterDOI
FROOTS – Fault Handling in Up*/Down* Routed Networks with Multiple Roots
I. Theiss,Olav Lysne +1 more
TL;DR: FRoots is based on a load balancing version of Up*/Down* routing, and uses a modest number of virtual channels to achieve redundancy properties, thus experiencing no performance loss compared to its predecessor routing algorithm.