避免失效节点和链路的备用路径分布式算法
Distributed Algorithms for Computing Alternate Paths Avoiding Failed Nodes and Links
摘要：
最近一项表征计算机网络中故障的研究表明，瞬时单元件（节点/链路）故障是像Internet这样的大型通信网络中的主要故障。因此，在发生故障时全局重新计算路由路径不会有回报，因为发生故障的元件恢复得相当快，并且需要丢弃重新计算的路由路径。在本文中，我们提出了第一个分布式算法，计算一些“主动恢复计划”处理瞬态故障所需的备用路径。我们的算法计算路径，避免一个失败的节点，并提供了一个替代路径的特定目的地从上游邻居的失败节点。通过微小的修改，我们可以让算法计算出避免失败链路的备用路径。据我们所知，所有以前提出的算法计算备用路径是集中的，需要完整的信息的网络图作为输入的算法。
英文摘要：
A recent study characterizing failures in computer networks shows that transient single element (node/link) failures are the dominant failures in large communication networks like the Internet. Thus, having the routing paths globally recomputed on a failure does not pay off since the failed element recovers fairly quickly, and the recomputed routing paths need to be discarded. In this paper, we present the first distributed algorithm that computes the alternate paths required by some "proactive recovery schemes" for handling transient failures. Our algorithm computes paths that avoid a failed node, and provides an alternate path to a particular destination from an upstream neighbor of the failed node. With minor modifications, we can have the algorithm compute alternate paths that avoid a failed link as well. To the best of our knowledge all previous algorithms proposed for computing alternate paths are centralized, and need complete information of the network graph as input to the algorithm.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
