On the Resiliency of Static Forwarding Tables
Name
Resiliency-ToN.pdf
Description
Accepted version
Size
1.67 MB
Format
Adobe PDF
Checksum (MD5)
269d9b8d87cd7917362dd22bdc22957f
Author(s)
Chiesa, Marco
Nikolaevskiy, Ilya
Mitrovic, Slobodan
Gurtov, Andrei
Madry, Aleksander
Schapira, Michael
Shenker, Scott
Date Issued
2017
Journal
Networking, IEEE-ACM Transactions on
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Version
Author's final manuscript
Abstract
© 1993-2012 IEEE. Fast reroute 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. In this paper, we embarked upon a systematic algorithmic study of the resiliency of forwarding tables in a variety of models (i.e., deterministic/probabilistic routing, with packet-header-rewriting, with packet-duplication). Our results show that the resiliency of a routing scheme depends on the 'connectivity' k of a network, i.e., the minimum number of link deletions that partition a network. We complement our theoretical result with extensive simulations. We show that resiliency to four simultaneous link failures, with limited path stretch, can be achieved without any packet modification/duplication or randomization. Furthermore, our routing schemes provide resiliency against k-1 failures, with limited path stretch, by storing (k) bits in the packet header, with limited packet duplication, or with randomized forwarding technique.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/TNET.2016.2619398
