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
Single link switching mechanism for fast recovery in tree-based recovery schemes
TL;DR: A self-protected spanning tree (SST) construction algorithm and the corresponding single link switching mechanism (SLSM) for tree-based recovery schemes, which provides a novel load balance mechanism by fast changing the topology of SST, which can not be implemented in the previously advocated tree- based schemes.
Proceedings ArticleDOI
Restoration measurements on an IP/MPLS backbone: the effect of fast reroute on link failure
TL;DR: A detailed study of the data shows that while loss-duration and overall duration is much reduced, TE/FRR results in path changes with no detectable loss over a period of seconds, which results in a vast improvement in behavior for all data flows.
Proceedings ArticleDOI
Partial Spatial Protection for Differentiated Reliability in FSTR-Based Metro Ethernet Networks
TL;DR: A mixed integer linear programming (MILP) model for PSP is developed to minimize the bandwidth reserved by an incoming traffic request while satisfying the protection grade required by the traffic request and can reduce the blocking probability of traffic requests in FSTR- based Metro Ethernet networks.
Proceedings ArticleDOI
Improving carrier ethernet recovery time using a fast reroute mechanism
TL;DR: A fast recovery mechanism that uses tunnels and cycles to provide a local recovery and is adapted to a Carrier-class Ethernet network controlled by a link-state protocol is presented.