静态快速重路由中的局部代价
On the Price of Locality in Static Fast Rerouting
摘要：
现代通信网络具有完全分散的流重路由机制，使它们能够对链路故障做出快速反应。本文回顾了这种本地快速重路由机制的基本算法问题。是否有可能实现完美的弹性，即，定义本地路由表，只要底层网络仍然连接，就可以保持连接？Feigenbaum等人（ACM PODC'12）和Foerster等人（SIAM APOCS'21）表明，不幸的是，这通常是不可能的。本文绘制了一个比较完整的景观图，探讨了完美复原力的可行性。我们首先展示了一个可能令人惊讶的大价格的本地静态快速重路由机制：即使当源和目的地保持连接的线性数量的链路不相交的路径后，链路故障，本地重路由算法无法找到他们中的任何一个，导致断开的路由级别。这促使我们研究的弹性图，排除某些密集的未成年人，如集团或一个完整的二分图，特别是，提供在不同的路由模型的完美弹性的可能性的表征。我们提供了进一步的见解，局部性的价格显示不可能的结果很少失败，并调查完美的弹性拓扑动物园网络。
英文摘要：
Modern communication networks feature fully decentralized flow rerouting mechanisms which allow them to quickly react to link failures. This paper revisits the fundamental algorithmic problem underlying such local fast rerouting mechanisms. Is it possible to achieve perfect resilience, i.e., to define local routing tables which preserve connectivity as long as the underlying network is still connected? Feigenbaum et al. (ACM PODC'12) and Foerster et al. (SIAM APOCS'21) showed that, unfortunately, it is impossible in general. This paper charts a more complete landscape of the feasibility of perfect resilience. We first show a perhaps surprisingly large price of locality in static fast rerouting mechanisms: even when source and destination remain connected by a linear number of link-disjoint paths after link failures, local rerouting algorithms cannot find any of them which leads to a disconnection on the routing level. This motivates us to study resilience in graphs which exclude certain dense minors, such as cliques or a complete bipartite graphs, and in particular, provide characterizations of the possibility of perfect resilience in different routing models. We provide further insights into the price of locality by showing impossibility results for few failures and investigate perfect resilience on Topology Zoo networks.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
