On the Resilience of Fast Failover Routing Against Dynamic Link Failures

TL;DR

This paper investigates the resilience of fast failover routing in networks against dynamic link failures, revealing limitations and potential enhancements through packet header rewriting.

Contribution

It categorizes link failures into static, semi-dynamic, and dynamic, and analyzes the resilience of failover routing under these scenarios, including the impact of packet header rewriting.

Findings

$k$-edge-connected graphs are $(k-1)$-resilient for $k \,\leq 5$

Rewriting $\,\log k$ bits enables resilience for arbitrary $k$

Resilience against $2$ dynamic failures is impossible without bit-rewriting

Abstract

Modern communication networks feature local fast failover mechanisms in the data plane, to swiftly respond to link failures with pre-installed rerouting rules. This paper explores resilient routing meant to tolerate $\leq k$ simultaneous link failures, ensuring packet delivery, provided that the source and destination remain connected. While past theoretical works studied failover routing under static link failures, i.e., links which permanently and simultaneously fail, real-world networks often face link flapping--dynamic down states caused by, e.g., numerous short-lived software-related faults. Thus, in this initial work, we re-investigate the resilience of failover routing against link flapping, by categorizing link failures into static, semi-dynamic (removing the assumption that links fail simultaneously), and dynamic (removing the assumption that links fail permanently) types, shedding light on the capabilities and limitations of failover routing under these scenarios. We show that $k$-edge-connected graphs exhibit $(k-1)$-resilient routing against dynamic failures for $k \leq 5$. We further show that this result extends to arbitrary $k$ if it is possible to rewrite $\log k$ bits in the packet header. Rewriting $3$ bits suffices to cope with $k$ semi-dynamic failures. However, on general graphs, tolerating $2$ dynamic failures becomes impossible without bit-rewriting. Even by rewriting $\log k$ bits, resilient routing cannot resolve $k$ dynamic failures, demonstrating the limitation of local fast rerouting.