The quest for resilient (static) forwarding tables
Author(s)
Chiesa, Marco; Nikolaevskiy, Ilya; Mitrovic, Slobodan; Panda, Aurojit; Gurtov, Andrei; Maidry, Aleksander; Schapira, Michael; Shenker, Scott; ... Show more Show less
DownloadAccepted version (297.6Kb)
Open Access Policy
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
Fast Reroute (FRR) and other forms of immediate failover have long been used to recover from certain classes of failures without invoking the network control plane. While the set of such techniques is growing, the level of resiliency to failures that this approach can provide is not adequately understood. We embark upon a systematic algorithmic study of the resiliency of immediate failover in a variety of models (with/without packet marking/duplication, etc.). We leverage our findings to devise new schemes for immediate failover and show, both theoretically and experimentally, that these outperform existing approaches. 2016 IEEE.
Date issued
2016-04Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Computer Science and Artificial Intelligence LaboratoryPublisher
IEEE
Citation
Chiesa, Marco, Nikolaevskiy, Ilya, Mitrovic, Slobodan, Panda, Aurojit, Gurtov, Andrei et al. 2016. "The quest for resilient (static) forwarding tables."
Version: Author's final manuscript