Brief announcement: on the resilience of routing tables
Joan Feigenbaum,Brighten Godfrey,Aurojit Panda,Michael Schapira,Scott Shenker,Ankit Singla +5 more
- pp 237-238
Reads0
Chats0
TLDR
This work begins the theoretical study of resilient routing tables, which incorporate "failover" paths into routers' forwarding tables and are used in many modern network designs.Abstract:
Many modern network designs incorporate "failover" paths into routers' forwarding tables We initiate the theoretical study of such resilient routing tablesread more
Citations
More filters
Proceedings Article
Ensuring connectivity via data plane mechanisms
TL;DR: The design, called Data-Driven Connectivity (DDC) ensures routing connectivity via data plane mechanisms, which will allow networks to provide a much higher degree of availability, while still providing flexible routing control.
Proceedings ArticleDOI
Provable data plane connectivity with local fast failover: introducing openflow graph algorithms
TL;DR: It is shown that the problem of computing failover tables is related to graph search, and three different algorithms achieving different tradeoffs are presented, in terms of the number of required failover rules, theNumber of tags, as well as the resulting path lengths.
Proceedings ArticleDOI
Scalable Multi-Failure Fast Failover via Forwarding Table Compression
TL;DR: A new forwarding table compression algorithm is contributed and the concept of compression-aware routing is introduced to improve the achieved compression ratio, and Plinko, a new forwarding model that is designed to have more easily compressible forwarding tables is created.
Journal ArticleDOI
On the Resiliency of Static Forwarding Tables
Marco Chiesa,Ilya Nikolaevskiy,Slobodan Mitrovic,Andrei Gurtov,Aleksander Madry,Michael Schapira,Scott Shenker +6 more
TL;DR: This paper embarked upon a systematic algorithmic study of the resiliency of forwarding tables in a variety of models (i.e., deterministic/probabilistic routing, with packets-header-rewriting, with packet-duplication), and shows that resiliencies to four simultaneous link failures, with limited path stretch, can be achieved without any packet modification/duplications or randomization.
Proceedings ArticleDOI
Plinko: building provably resilient forwarding tables
TL;DR: This paper introduces Plinko, a network architecture that uses a novel forwarding model and routing algorithm to build networks with forwarding paths that, assuming arbitrarily large forwarding tables, are provably resilient against t link failures, ∀t ∈ N.
References
More filters
Fast Reroute Extensions to RSVP-TE for LSP Tunnels
TL;DR: This document defines RSVP-TE extensions to establish backup label- switched path (LSP) tunnels for local repair of LSP tunnels to allow nodes to implement either method or both and to interoperate in a mixed network.
Proceedings ArticleDOI
Fast IP Network Recovery Using Multiple Routing Configurations
TL;DR: This paper presents a new recovery scheme called Multiple Routing Configurations (MRC), based on keeping additional routing information in the routers, and allows packet forwarding to continue on an alternative output link immediately after the detection of a failure.
Proceedings Article
R-BGP: staying connected In a connected world
TL;DR: Simulations on the AS-level graph of the current Internet show that R-BGP reduces the number of domains that see transient disconnectivity resulting from a link failure from 22% for edge links and 14% for core links down to zero in both cases.
Proceedings ArticleDOI
Achieving convergence-free routing using failure-carrying packets
Karthik Lakshminarayanan,Matthew Caesar,Murali Rangan,Thomas Anderson,Scott Shenker,Ion Stoica +5 more
TL;DR: This work proposes a technique called Failure-Carrying Packets (FCP), a technique that allows data packets to autonomously discover a working path without requiring completely up-to-date state in routers, and shows that it provides better routing guarantees under failures despite maintaining lesser state at the routers.
Proceedings ArticleDOI
Proactive vs reactive approaches to failure resilient routing
TL;DR: It is proved that when no more than one link failure notification is suppressed, FIR always finds a loop-free path to a destination if one such path exists, and it is shown that FIR provides better stability and availability than OSPF.