3 research outputs found
Maximally Resilient Replacement Paths for a Family of Product Graphs
Modern communication networks support fast path restoration mechanisms which allow to reroute traffic in case of (possibly multiple) link failures, in a completely decentralized manner and without requiring global route reconvergence. However, devising resilient path restoration algorithms is challenging as these algorithms need to be inherently local. Furthermore, the resulting failover paths often have to fulfill additional requirements related to the policy and function implemented by the network, such as the traversal of certain waypoints (e.g., a firewall).
This paper presents local algorithms which ensure a maximally resilient path restoration for a large family of product graphs, including the widely used tori and generalized hypercube topologies. Our algorithms provably ensure that even under multiple link failures, traffic is rerouted to the other endpoint of every failed link whenever possible (i.e. detouring failed links), enforcing waypoints and hence accounting for the network policy. The algorithms are particularly well-suited for emerging segment routing networks based on label stacks
Randomized Local Fast Rerouting for Datacenter Networks with Almost Optimal Congestion
To ensure high availability, datacenter networks must rely on local fast
rerouting mechanisms that allow routers to quickly react to link failures, in a
fully decentralized manner. However, configuring these mechanisms to provide a
high resilience against multiple failures while avoiding congestion along
failover routes is algorithmically challenging, as the rerouting rules can only
depend on local failure information and must be defined ahead of time. This
paper presents a randomized local fast rerouting algorithm for Clos networks,
the predominant datacenter topologies. Given a graph describing a
Clos topology, our algorithm defines local routing rules for each node , which only depend on the packet's destination and are conditioned on the
incident link failures. We prove that as long as number of failures at each
node does not exceed a certain bound, our algorithm achieves an asymptotically
minimal congestion up to polyloglog factors along failover paths. Our lower
bounds are developed under some natural routing assumptions
On the Feasibility of Perfect Resilience with Local Fast Failover
To appear in the proceedings of the 2nd Symposium on Algorithmic Principles of Computer Systems (APOCS) 2021International audienceIn order to provide a high resilience and to react quickly to link failures, modern computer networks support fully decentralized flow rerouting, also known as local fast failover. In a nutshell, the task of a local fast failover algorithm is to pre-define fast failover rules for each node using locally available information only. These rules determine for each incoming link from which a packet may arrive and the set of local link failures (i.e., the failed links incident to a node), on which outgoing link a packet should be forwarded. Ideally, such a local fast failover algorithm provides a perfect resilience deterministically: a packet emitted from any source can reach any target, as long as the underlying network remains connected. Feigenbaum et al. (ACM PODC 2012) and also Chiesa et al. (IEEE/ACM Trans. Netw. 2017) showed that it is not always possible to provide perfect resilience. Interestingly, not much more is known currently about the feasibility of perfect resilience. This paper revisits perfect resilience with local fast failover, both in a model where the source can and cannot be used for forwarding decisions. We first derive several fairly general impossibility results: By establishing a connection between graph minors and resilience, we prove that it is impossible to achieve perfect resilience on any non-planar graph; furthermore, while planarity is necessary, it is also not sufficient for perfect resilience. On the positive side, we show that graph families closed under link subdivision allow for simple and efficient failover algorithms which simply skip failed links. We demonstrate this technique by deriving perfect resilience for outerplanar graphs and related scenarios, as well as for scenarios where the source and target are topologically close after failures