Loopback recovery from double-link failures in optical mesh networks
Loopback recovery from double-link failures in optical mesh networks
复制标题
DOI：
10.1109/tnet.2004.838595
复制
发表时间：
2004-12
期刊：
影响因子：
--
通讯作者：
Hongsik Choi;S. Subramaniam;Hyeong-Ah Choi
中科院分区：
文献类型：
--
作者：
Hongsik Choi;S. Subramaniam;Hyeong-Ah Choi
网络生存性是高速光网络的一个重要要求。提供生存性的典型方法考虑了单个组件（如链路或节点）的故障。我们激励需要考虑双链路故障，并提出了三种方法来处理这种故障。在前两种方法中，为每条链路计算两条边不相交的备用路径，以便在一对链路发生故障时重新路由流量。这些方法需要在完成恢复之前识别故障链路。第三种方法需要预先计算单个备份路径，并且在恢复之前不需要链路标识。然后提出了一种算法，预先计算备份路径的链路，以容忍双链路故障。数值结果比较我们的算法与其他方法的性能表明，它是可能实现几乎100%的恢复从双链路故障与适度增加备份容量。我们的方法的一个显着特点是，它是可能的权衡能力，通过选择一个子集的双链路故障和设计备份路径，使用我们的算法，只有这些故障的情况下。
Network survivability is a crucial requirement in high-speed optical networks. Typical approaches of providing survivability have considered the failure of a single component such as a link or a node. We motivate the need for considering double-link failures and present three loopback methods for handling such failures. In the first two methods, two edge-disjoint backup paths are computed for each link for rerouting traffic when a pair of links fails. These methods require the identification of the failed links before recovery can be completed. The third method requires the precomputation of a single backup path and does not require link identification before recovery. An algorithm that precomputes backup paths for links in order to tolerate double-link failures is then presented. Numerical results comparing the performance of our algorithm with other approaches suggest that it is possible to achieve almost 100% recovery from double-link failures with a moderate increase in backup capacity. A remarkable feature of our approach is that it is possible to trade off capacity for restorability by choosing a subset of double-link failures and designing backup paths using our algorithm for only those failure scenarios.