On the Resiliency of Static Forwarding Tables

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” <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> 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 <inline-formula> <tex-math notation="LaTeX">$k-1$ </tex-math></inline-formula> failures, with limited path stretch, by storing <inline-formula> <tex-math notation="LaTeX">$\log (k)$ </tex-math></inline-formula> bits in the packet header, with limited packet duplication, or with randomized forwarding technique.