arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1704.07067cs.DMcs.DS
收藏

链路故障时重新路由流

Rerouting flows when links fail

Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo

摘要:

我们介绍和调查可重路由流,一个强大的版本的网络流中,链路故障可以减轻重路由受影响的流量。给定一个有容量限制的网络,如果在任意弧故障后,我们可以将中断的流从该弧的尾部重新路由到sink,而不修改不受故障影响的流,则路径流是可重路由的。类似类型的恢复,这通常被称为“本地”,以前在网络设计的背景下,如最小成本容量规划的调查。在本文中,我们的兴趣是在计算最大流在这个鲁棒性假设。我们的模型的一个重要的新特征,区别于现有的最大鲁棒流模型,是没有流可以在网络中丢失。我们还研究了紧缩的可重路由流,称为严格可重路由流,使更多的限制性假设的能力可用于重路由。对于这两种变体,我们设计了一个可重路由流等价的S-T-切,并表明相应的最大流/最小切间隙是有界的2。事实证明,一个严格的可重路由流的最大值可以找到使用一个紧凑的LP公式,而找到一个最大的可重路由流的问题是NP-困难的,即使当所有的能力是在{1,2}。然而,紧缩可以用来获得2-近似的可重路由流。这个比率在一般网络中是紧的,但我们表明,在单位容量的情况下,每一个可重路由流可以转化为一个严格的可重路由流相同的价值。虽然它是NP-难计算的最大积分流,即使为单位的能力,我们设计了一个令人惊讶的简单的组合算法,找到一个半积分严格可重路由流的值为1,或证明没有这样的解决方案存在。最后,我们也给出了硬度的情况下,多个电弧故障的结果。

英文摘要:

We introduce and investigate reroutable flows, a robust version of network flows in which link failures can be mitigated by rerouting the affected flow. Given a capacitated network, a path flow is reroutable if after failure of an arbitrary arc, we can reroute the interrupted flow from the tail of that arc to the sink, without modifying the flow that is not affected by the failure. Similar types of restoration, which are often termed "local", were previously investigated in the context of network design, such as min-cost capacity planning. In this paper, our interest is in computing maximum flows under this robustness assumption. An important new feature of our model, distinguishing it from existing max robust flow models, is that no flow can get lost in the network. We also study a tightening of reroutable flows, called strictly reroutable flows, making more restrictive assumptions on the capacities available for rerouting. For both variants, we devise a reroutable-flow equivalent of an s-t-cut and show that the corresponding max flow/min cut gap is bounded by 2. It turns out that a strictly reroutable flow of maximum value can be found using a compact LP formulation, whereas the problem of finding a maximum reroutable flow is NP-hard, even when all capacities are in {1, 2}. However, the tightening can be used to get a 2-approximation for reroutable flows. This ratio is tight in general networks, but we show that in the case of unit capacities, every reroutable flow can be transformed into a strictly reroutable flow of same value. While it is NP-hard to compute a maximal integral flow even for unit capacities, we devise a surprisingly simple combinatorial algorithm that finds a half-integral strictly reroutable flow of value 1, or certifies that no such solutions exits. Finally, we also give a hardness result for the case of multiple arc failures.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑