arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1605.04434cs.NI
收藏

建立多个可生存连接(扩展版)

Establishing Multiple Survivable Connections (Extended Version)

Michael Keslassy, Ariel Orda

摘要:

我们考虑在可生存网络中建立连接,其中每个连接分配有一个工作(主)路径和一个保护(备份)路径。虽然已经找到了许多最佳的解决方案,为建立一个单一的连接,只有算法已经提出了多连接的情况下。我们研究了在线和离线框架中多连接建立问题的算法易处理性。首先,我们专注于两个连接的特殊情况下,并研究问题的三个变种的易处理性。我们发现,只有一个变种是听话的,我们建立了多项式复杂性的最佳解决方案。对于其他变种,这是NP-难的,启发式计划提出。这些策略是根据我们的研究所获得的见解设计的。通过模拟,我们表明这些prosticistics的优势,更直接的替代品。我们将我们的研究扩展到K连接,对于一个固定的K大于2。我们证明了该问题的在线和离线变体的可处理性,其中允许沿备份路径共享链接,并且我们建立了相应的最优解决方案。另一方面,我们表明,如果连接数不固定(即,K不是O(1)),那么问题一般是NP难的。

英文摘要:

We consider the establishment of connections in survivable networks, where each connection is allocated with a working (primary) path and a protection (backup) path. While many optimal solutions have been found for the establishment of a single connection, only heuristics have been proposed for the multi-connection case. We investigate the algorithmic tractability of multi-connection establishment problems, both in online and offline frameworks. First, we focus on the special case of two connections, and study the tractability of three variants of the problem. We show that only one variant is tractable, for which we establish an optimal solution of polynomial complexity. For the other variants, which are shown to be NP-hard, heuristic schemes are proposed. These heuristics are designed based on the insight gained from our study. Through simulations, we indicate the advantages of these heuristics over more straightforward alternatives. We extend our study to K connections, for a fixed K that is larger than 2. We prove the tractability of online and offline variants of the problem, in which sharing links along backup paths is allowed, and we establish corresponding optimal solutions. On the other hand, we show that, if the number of connections is not fixed (i.e., K is not O(1)), then the problem is, in general, NP-hard.

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

↑