关于局部快速恢复的完全恢复的可行性
On the Feasibility of Perfect Resilience with Local Fast Failover
摘要:
为了提供高弹性并对链路故障快速反应,现代计算机网络支持完全分散的流重新路由,也称为本地快速故障转移。简而言之,本地快速故障转移算法的任务是仅使用本地可用信息为每个节点预定义快速故障转移规则。这些规则确定分组可能从其到达的每个输入链路以及本地链路故障的集合(即,发生在节点上的故障链路),分组应该在哪个输出链路上被转发。理想情况下,这种本地快速故障转移算法提供了一个完美的弹性确定性:从任何源发出的数据包可以到达任何目标,只要底层网络保持连接。Feigenbaum等人(ACM PODC 2012)以及Chiesa等人(IEEE/ACM Trans.Netw. 2017)表明,并不总是能够提供完美的弹性。有趣的是,目前对完美弹性的可行性知之甚少。本文重新审视了具有本地快速故障转移的完美恢复能力,无论是在源可以用于还是不能用于转发决策的模型中。我们首先得到几个相当普遍的不可能性结果:通过建立图子和弹性之间的联系,我们证明了它是不可能实现完美的弹性在任何非平面图;此外,虽然平面性是必要的,但它也不足以实现完美的弹性。在积极的一面,我们表明,图形家庭关闭下的链接细分允许简单而有效的故障转移算法,简单地跳过失败的链接。我们证明了这种技术,得到完美的弹性外平面图和相关的情况下,以及在源和目标的拓扑关闭故障后的情况下。
英文摘要:
In 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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。