Fault-Tolerant Dynamic Routing Based on Maximum Flow Evaluation

Abstract

This work proposes a fault-tolerant dynamic routing algorithm that employs maximum flow evaluation for route selection, increasing the number of disjoint paths to the destination, enhancing the path redundancy, and so extending the possibility of using detours, or alternative paths if needed. Route distance is employed as a secondary criterion. Routes may be dynamically changed by intermediate routers, which usually have more recent information about topology changes. Formal proofs for correctness of the algorithm are also presented. The proposed algorithm was implemented in a simulation environment and experimental results are presented.

On the Price of Locality in Static Fast Rerouting

“…The question of how to provide resilient routing in networks is a fundamental one and has been explored intensively in the literature already [4]. In particular, failover resiliency can impose a trade-off on, e.g., stretch or latency [5]- [7]: "a robust route is not necessarily the shortest route" [8]. Hence, it can be worthwhile to consider detours through highly connected components, in case further failures appear downstream [9], and to such an end also investigate on how to rank the connectivity properties of nodes [10].…”

“…perfect resilience-on the other hand, if the network was outerplanar, we marked it as possible. From the remaining graphs, if there exists a forwarding pattern for a subset of destinations 7 , we marked them as sometimes 8 , with the remaining networks marked as unknown.…”

“…https://www.sagemath.org/ 5 https://github.com/dwavesystems/minorminer 6 https://github.com/yvonneanne/dsn22 7 I.e, if the graph is outerplanar after removing the destination, because then we can tour all neighbors of the destination 8. We give an example in Fig.6.…”