Game-theoretic resource allocation for malicious packet detection in computer networks

摘要: We study the problem of optimal resource allocation for packet selection and inspection to detect potential threats in large computer networks with multiple computers differing importance. An attacker tries harm these targets by sending malicious packets from entry points network; defender thus needs optimally allocate her resources maximize probability detection under network latency constraints.We formulate as a graph-based security game heterogeneous capabilities propose mathematical program finding solutions. also Grande, novel polynomial time algorithm that uses an approximated utility function circumvent limited scalability caused attacker's strategy space non-linearity aforementioned program. Grande computes solutions bounded error scales up problems realistic sizes.