Fault-tolerant routing allows the selection of alternative routes to the destination after the route being used fails. Fast Reroute (FRR) is a proactive strategy through which the protocol pre-configures backup routes that are activated when needed. In this work, we propose the MaxFlowRouting algorithm that employs maximum flow evaluation as well as the route size to select routes that are highly connected. The main advantage of the proposed algorithm is that if any component of such a route fails, there are more alternative paths to the destination in comparison with the route computed with Dijkstra's shortest path algorithm. Simulation results are presented in which we compare the two algorithms (Dijkstra's and MaxFlowRouting) for multiple different random graphs (including Erdos-Renyi, Bar\'abasi-Albert, and Watts-Strogatz) and also for the topologies of some of the most important Internet backbones of the U.S.A., Europe, Brazil, and Japan: Internet2, Geant, RNP, and Wide.

翻译：容错路由允许在正在使用的路由失效后选择替代路径到达目的地。快速重路由（FRR）是一种主动策略，协议通过该策略预先配置在需要时激活的备份路由。本文提出MaxFlowRouting算法，该算法利用最大流评估及路由规模来选择具有高连通性的路由。与Dijkstra最短路径算法计算的路由相比，所提算法的主要优势在于：当此类路由的任何组件发生故障时，存在更多通往目的地的替代路径。我们通过仿真结果比较了两种算法（Dijkstra算法与MaxFlowRouting算法）在多种随机图（包括Erdos-Renyi、Barabasi-Albert和Watts-Strogatz模型）以及美国、欧洲、巴西和日本部分最重要互联网骨干网拓扑（Internet2、Geant、RNP和Wide）上的性能表现。