A Survey of Fast-Recovery Mechanisms in Packet-Switched Networks
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 packet-switched 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, summarize the main lessons learned, and propose a few concrete future directions.read more
Citations
More filters
ISIS Extensions to support U-turn Alternates for IP/LDP Fast-Reroute
TL;DR: In this paper, the authors specify additional information that can be inserted in IS-IS LSPs to convey link capabilities that may be useful in certain application cases, such as local protection, provided by a U-turn alternate, in the event of a node failure and/or node reconverging onto a new topology.
Journal ArticleDOI
Post-Disaster Communications: Enabling Technologies, Architectures, and Open Challenges
TL;DR: The state-of-the-art literature on post-disaster wireless communication networks is reviewed, and insights for the future establishment of such networks are provided and several promising research directions are presented.
Journal ArticleDOI
Post-Disaster Communications: Enabling Technologies, Architectures, and Open Challenges
TL;DR: In this article , the authors review the state-of-the-art literature on post-disaster wireless communication networks and provide insights for the future establishment of such networks and present technological solutions for postdisaster communications, such as the recovery of the terrestrial infrastructure, installing aerial networks, and using spaceborne networks.
Journal ArticleDOI
Fast Path Recovery for Single Link Failure in SDN-Enabled Wide Area Measurement System
TL;DR: In this article , a hybrid fast path recovery algorithm (HFPR-A) is proposed based on the principle of simplicity, where in some cases, the shortest path or approximate shortest path between PMU and PDC can be recovered by adding only one edge to the original forwarding tree; while in other cases the shortest paths can be recover with
Journal ArticleDOI
Data plane failure and its recovery techniques in SDN: A systematic literature review
TL;DR: In this article , the authors reviewed 188 papers from 2010 to 2021, selecting 70 articles that are highly relevant to our work and collected a large amount of evidence that will assist the industry and academic researchers in networking to address current research gaps in failure recovery solutions for the SDN data plane.
References
More filters
Proceedings ArticleDOI
Redundant trees for fast IP recovery
TL;DR: This work presents a new mechanism for IP fast recovery called IP Redundant Trees (IPRT), which builds two redundant trees per network destination and pre-calculates backup next hops based on them and argues that IPRT indeed has very attractive properties.
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.
Proceedings ArticleDOI
PURR: a primitive for reconfigurable fast reroute: hope for the best and program for the worst
Marco Chiesa,Roshan Sedar,Gianni Antichi,Michael Borokhovich,Andrzej Kamisinski,Georgios Nikolaidis,Stefan Schmid +6 more
TL;DR: An FRR primitive for programmable data planes, PURR, which provides low failover latency and high switch throughput, by avoiding packet recirculation, and is well-suited for high-speed match-action forwarding architectures.
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.