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 Article
F10: a fault-tolerant engineered network
TL;DR: This work creates an engineered network and routing protocol that can almost instantaneously reestablish connectivity and load balance, even in the presence of multiple failures, and shows that following network link and switch failures, F10 has less than 1/7th the packet loss of current schemes.
Proceedings ArticleDOI
An experimental analysis of BGP convergence time
Timothy G. Griffin,B.J. Premore +1 more
TL;DR: This work uses the SSFNet simulator to explore the relationship between convergence time and the configuration of a BGP-specific timer used to limit the rate at which routing messages are transmitted, and observes that there is an optimal value for the rate-limiting timer that minimizes convergence time.
Proceedings ArticleDOI
Taking the Edge off with Espresso: Scale, Reliability and Programmability for Global Internet Peering
Kok-Kiong Yap,Murtaza Motiwala,Jeremy Rahe,Steven Padgett,Matthew Jonathan Holliman,Gary Baldus,Marcus Hines,Taeeun Kim,Ashok Narayanan,Ankur Jain,Victor Lin,Colin Rice,Brian Rogan,Arjun Singh,Bert Tanaka,Manish Verma,Puneet Sood,Mukarram Bin Tariq,Matt Tierney,Dzevad Trumic,Vytautas Valancius,Calvin Ying,Mahesh Kallahalla,Bikash Koley,Amin Vahdat +24 more
TL;DR: Espresso provides Google a scalable peering edge that is programmable, reliable, and integrated with global traffic systems and greatly accelerated deployment of new networking features at the peering Edge.
Proceedings ArticleDOI
Measuring the effects of internet path faults on reactive routing
TL;DR: The findings suggest that reactive routing is most effective between hosts that have multiple connections to the Internet, and passive observations of BGP routing messages could be used to predict about 20% of impending failures, allowing re-routing systems to react more quickly to failures.
Patent
Bidirectional forwarding detection
David M. Katz,David Ward +1 more
TL;DR: In this article, the authors propose a protocol for detecting faults in a bidirectional path between two forwarding engines, where parts of the path checked may include interfaces, one or more data links, and to the extent possible the forwarding engines themselves, with potentially low latency.