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

基于对抗性业务流的网络阻断

Network Interdiction Using Adversarial Traffic Flows

Xinzhe Fu, Eytan Modiano

摘要:

传统的网络阻断是指阻断者试图通过移除网络边缘来降低网络用户的吞吐量的问题。在本文中,我们提出了一个新的模式,网络阻断模型的情况下,如隐形拒绝服务攻击,阻断是通过注入敌对的流量流。在这种范式下,我们首先研究了确定性流阻断问题,其中阻断者对网络用户的操作具有完美的知识。我们表明,这个问题是高度不可逼近的一般网络,是NP-困难的,即使当网络是无环的。然后,我们提出了一个算法,实现了对数逼近比和准多项式时间复杂性的非循环网络,通过利用子模块化的问题。接下来,我们研究了鲁棒流阻断问题,该问题采用鲁棒优化框架来捕获网络用户操作的确定性知识不可用的情况。我们设计了一个近似框架,集成了上述算法,产生一个准多项式时间的程序与多对数近似比更具挑战性的强大的流量阻断。最后,我们通过模拟评估所提出的算法的性能,表明它们可以有效地实现,并产生接近最优的解决方案。

英文摘要:

Traditional network interdiction refers to the problem of an interdictor trying to reduce the throughput of network users by removing network edges. In this paper, we propose a new paradigm for network interdiction that models scenarios, such as stealth DoS attack, where the interdiction is performed through injecting adversarial traffic flows. Under this paradigm, we first study the deterministic flow interdiction problem, where the interdictor has perfect knowledge of the operation of network users. We show that the problem is highly inapproximable on general networks and is NP-hard even when the network is acyclic. We then propose an algorithm that achieves a logarithmic approximation ratio and quasi-polynomial time complexity for acyclic networks through harnessing the submodularity of the problem. Next, we investigate the robust flow interdiction problem, which adopts the robust optimization framework to capture the case where definitive knowledge of the operation of network users is not available. We design an approximation framework that integrates the aforementioned algorithm, yielding a quasi-polynomial time procedure with poly-logarithmic approximation ratio for the more challenging robust flow interdiction. Finally, we evaluate the performance of the proposed algorithms through simulations, showing that they can be efficiently implemented and yield near-optimal solutions.

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

↑