Attacking Unexplored Networks-The Probe-and-Attack Problem
BH Chong, M Ventresca - Complex Networks & Their Applications VI …, 2018 - Springer
Complex Networks & Their Applications VI: Proceedings of Complex Networks 2017 …, 2018•Springer
Attackers generally do not have complete information about the structure and function of a
target network, and thus have to distribute resources between actions that directly achieve
an objective to return some utility ('Attack'), and actions that expose new knowledge about
the network ('Probe') allowing new actions to be taken. We introduce the NP-hard two-action
Probe-and-Attack Problem (PAP) and provide methods to compute upper and lower bounds
on the optimal solution. We then compare the bounds to the performance of two greedy …
target network, and thus have to distribute resources between actions that directly achieve
an objective to return some utility ('Attack'), and actions that expose new knowledge about
the network ('Probe') allowing new actions to be taken. We introduce the NP-hard two-action
Probe-and-Attack Problem (PAP) and provide methods to compute upper and lower bounds
on the optimal solution. We then compare the bounds to the performance of two greedy …
Abstract
Attackers generally do not have complete information about the structure and function of a target network, and thus have to distribute resources between actions that directly achieve an objective to return some utility (‘Attack’), and actions that expose new knowledge about the network (‘Probe’) allowing new actions to be taken. We introduce the NP-hard two-action Probe-and-Attack Problem (PAP) and provide methods to compute upper and lower bounds on the optimal solution. We then compare the bounds to the performance of two greedy algorithms on specialized instances of the problem.
Springer
Showing the best result for this search. See all results