Finding Failure-Disjoint Paths for Path Diversity Protection in Communication Networks
Finding Failure-Disjoint Paths for Path Diversity Protection in Communication Networks
复制标题
DOI：
10.1109/lcomm.2010.08.100653
复制
发表时间：
2010-08
期刊：
影响因子：
--
通讯作者：
M. Żotkiewicz;W. Ben-Ameur;M. Pióro
中科院分区：
文献类型：
--
作者：
M. Żotkiewicz;W. Ben-Ameur;M. Pióro
在本文中，我们考虑了通信网络中与路径分集保护密切相关的流问题。给定一个加权有向图，其中一些弧会发生故障，而另一些弧则有弹性，我们的目标是计算一对最短的故障不相交路径。如果两条路径都使用弹性弧，则其成本仅计算一次。我们提出了一个原始的多项式时间算法来解决这个问题。
In the paper we consider a flow problem closely related to path diversity protection in communication networks. Given a weighted directed graph where some arcs are subject to failures while others are resilient, we aim at computing a shortest pair of failure-disjoint paths. If a resilient arc is used by both paths, its cost is counted only once. We present an original polynomial-time algorithm for solving the problem.