强大的布线变得简单
Robust Routing Made Easy
摘要:
随着通信网络规模的不断扩大,发生故障的可能性也在增加。由于这些网络构成了我们数字社会的关键骨干,因此它们依赖于强大的路由算法,即使出现故障也能确保连通性,这一点非常重要。虽然大多数现代通信网络都具有强大的路由机制,但这些机制的设计和验证往往相当复杂,因为它们需要考虑故障和重新路由对通信的影响。本文重新审视鲁棒路由机制的设计,旨在避免这种复杂性。特别是,我们展示了简单和通用的黑盒变换,增加了对独立分布的故障,这使得模拟原始网络上的路由方案,即使在存在非良性节点故障(以下称为故障)的路由的弹性。这是有吸引力的,因为可以简单地保留系统规范和路由策略。我们提出了一个计划,用于构建这样一个加强的网络,现有的(同步)网络和路由方案。我们证明,该算法来与小恒定的开销,只需要一个额外的节点和边缘资源的最小量。同时,它允许容忍大量的独立随机(节点)故障,渐近几乎肯定。我们补充我们的分析结果与模拟不同的现实世界的拓扑结构。
英文摘要:
With the increasing scale of communication networks, the likelihood of failures grows as well. Since these networks form a critical backbone of our digital society, it is important that they rely on robust routing algorithms which ensure connectivity despite such failures. While most modern communication networks feature robust routing mechanisms, these mechanisms are often fairly complex to design and verify, as they need to account for the effects of failures and rerouting on communication. This paper revisits the design of robust routing mechanisms, with the aim to avoid such complexity. In particular, we showcase simple and generic blackbox transformations that increase resilience of routing against independently distributed failures, which allows to simulate the routing scheme on the original network, even in the presence of non-benign node failures (henceforth called faults). This is attractive as the system specification and routing policy can simply be preserved. We present a scheme for constructing such a reinforced network, given an existing (synchronous) network and a routing scheme. We prove that this algorithm comes with small constant overheads, and only requires a minimal amount of additional node and edge resources. At the same time, it allows to tolerate a large number of independent random (node) faults, asymptotically almost surely. We complement our analytical results with simulations on different real-world topologies.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。