用于网络性能评估的连续域长度受限路径阻断算法
Length-Bounded Paths Interdiction in Continuous Domain for Network Performance Assessment
摘要:
研究网络系统,其中节点之间的通信是功能,如果它们的距离低于一个预定义的阈值下,在给定的度量,最近受到了极大的关注。在这项工作中,我们提出了一个指标来衡量网络弹性保证预定义的性能约束。该度量的优化问题,即\textbf{Length-bounded Paths Interdiction in Continuous Domain}(cLPI),其目的是确定一组最小的节点,其变化导致节点之间的路由路径成为不可取的网络服务。我们证明了这个问题是NP难的,并提出了一个框架,通过设计两个预言机,\textit{Threshold Blocking}(TB)和\textit{Critical Path Listing}(CPL),来回通信,以构建一个可行的解决方案,cLPI与理论的双准则近似保证。基于这个框架,我们提出了两个解决方案,为每个甲骨文。一种\tb解决方案和一种\cpl解决方案的每种组合都为我们提供了一种cLPI解决方案。我们的算法的双准则保证,使我们能够控制解决方案的返回大小和性能精度之间的权衡。通过实验分析进一步讨论了每个解决方案的优点的新见解。
英文摘要:
Studying on networked systems, in which a communication between nodes is functional if their distance under a given metric is lower than a pre-defined threshold, has received significant attention recently. In this work, we propose a metric to measure network resilience on guaranteeing the pre-defined performance constraint. This metric is investigated under an optimization problem, namely \textbf{Length-bounded Paths Interdiction in Continuous Domain} (cLPI), which aims to identify a minimum set of nodes whose changes cause routing paths between nodes become undesirable for the network service. We show the problem is NP-hard and propose a framework by designing two oracles, \textit{Threshold Blocking} (TB) and \textit{Critical Path Listing} (CPL), which communicate back and forth to construct a feasible solution to cLPI with theoretical bicriteria approximation guarantees. Based on this framework, we propose two solutions for each oracle. Each combination of one solution to \tb and one solution to \cpl gives us a solution to cLPI. The bicriteria guarantee of our algorithms allows us to control the solutions's trade-off between the returned size and the performance accuracy. New insights into the advantages of each solution are further discussed via experimental analysis.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。