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

有限查询图连通性测试

Limited Query Graph Connectivity Test

University of Adelaide(阿德莱德大学)

Mingyu Guo, Jialiang Li, Aneta Neumann, Frank Neumann, Hung Nguyen

AI总结:

本文提出有限查询图连通性测试模型,通过可扩展精确算法、RL、MCTS 等策略最小化期望查询数,并在大规模网络安全图上验证其近优性能。

摘要:

我们提出了一个名为“有限查询图连通性测试”的组合优化模型。我们考虑一个边具有两种可能状态(开/关)的图。边的状态最初是隐藏的。我们可以查询一条边以揭示其状态。给定源点 s 和终点 t,我们的目标是通过识别一条路径(仅由处于开状态的边组成)或一个割(仅由处于关状态的边组成)来测试 s-t 连通性。我们被限制只能进行 B 次查询,之后无论是否确定图的连通性都会停止。我们的目标是设计一种使期望查询次数最小化的查询策略。\n\n我们的模型主要受一个网络安全用例启发:在该用例中,我们需要确定网络中源点与终点之间是否存在攻击路径。边查询需要由 IT 管理员通过人工工作来完成,这正是查询最小化背后的动机。\n\n我们的模型与单调随机布尔函数求值(SBFE)高度相关。SBFE 现有两种精确算法,但它们的代价高得令人却步。我们提出了一种可扩展性显著更强的精确算法。以往的精确算法只能扩展到平凡图(即以往工作实验中的边数至多为 20),而我们通过实验证明,我们的算法可扩展到范围广泛、大得多的实际图(例如具有数万条边的 Windows 域网络图)。\n\n我们提出了三种启发式方法。表现最好的启发式方法通过缩减精确算法的搜索视野得到。另外两种分别通过强化学习(RL)和蒙特卡洛树搜索(MCTS)得到。我们还推导了一种用于计算性能下界的任意时间算法。实验表明,我们所有的启发式方法都接近最优。基于精确算法的启发式方法表现优于所有其他方法,超过了 RL、MCTS 以及从 SBFE 和相关文献中移植的 8 种现有启发式方法。

英文摘要:

We propose a combinatorial optimisation model called Limited Query Graph Connectivity Test. We consider a graph whose edges have two possible states (On/Off). The edges' states are hidden initially. We could query an edge to reveal its state. Given a source s and a destination t, we aim to test s-t connectivity by identifying either a path (consisting of only On edges) or a cut (consisting of only Off edges). We are limited to B queries, after which we stop regardless of whether graph connectivity is established. We aim to design a query policy that minimizes the expected number of queries. Our model is mainly motivated by a cyber security use case where we need to establish whether an attack path exists in a network, between a source and a destination. Edge query is resolved by manual effort from the IT admin, which is the motivation behind query minimization. Our model is highly related to monotone Stochastic Boolean Function Evaluation (SBFE). There are two existing exact algorithms for SBFE that are prohibitively expensive. We propose a significantly more scalable exact algorithm. While previous exact algorithms only scale for trivial graphs (i.e., past works experimented on at most 20 edges), we empirically demonstrate that our algorithm is scalable for a wide range of much larger practical graphs (i.e., Windows domain network graphs with tens of thousands of edges). We propose three heuristics. Our best-performing heuristic is via reducing the search horizon of the exact algorithm. The other two are via reinforcement learning (RL) and Monte Carlo tree search (MCTS). We also derive an anytime algorithm for computing the performance lower bound. Experimentally, we show that all our heuristics are near optimal. The exact algorithm based heuristic outperforms all, surpassing RL, MCTS and 8 existing heuristics ported from SBFE and related literature.

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

↑