Game-theoretic Resource Allocation for Malicious Packet Detection in Computer Networks

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F12%3A00195286" target="_blank" >RIV/68407700:21230/12:00195286 - isvavai.cz</a>

Výsledek na webu

<a href="http://dl.acm.org/citation.cfm?id=2343826" target="_blank" >http://dl.acm.org/citation.cfm?id=2343826</a>

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Game-theoretic Resource Allocation for Malicious Packet Detection in Computer Networks

Popis výsledku v původním jazyce

We study the problem of optimal resource allocation for packet selection and inspection to detect potential threats in large computer networks with multiple valuable computers of differing importance. An attacker tries to harm these targets by sending malicious packets from multiple entry points of the network; the defender thus needs to optimally allocate his resources to maximize the probability of malicious packet detection under network latency constraints. We formulate the problem as a graph-basedsecurity game with multiple resources of heterogeneous capabilities and propose a mathematical program for finding optimal solutions. Due to the very limited scalability caused by the large attacker's strategy space and non-linearity of the program, we investigate solutions with approximated utility function and propose Grande, a novel polynomial approximate al- gorithm utilizing submodularity of the problem able to find solutions with a bounded error on problem of a realistic size.

Název v anglickém jazyce

Game-theoretic Resource Allocation for Malicious Packet Detection in Computer Networks

Popis výsledku anglicky

We study the problem of optimal resource allocation for packet selection and inspection to detect potential threats in large computer networks with multiple valuable computers of differing importance. An attacker tries to harm these targets by sending malicious packets from multiple entry points of the network; the defender thus needs to optimally allocate his resources to maximize the probability of malicious packet detection under network latency constraints. We formulate the problem as a graph-basedsecurity game with multiple resources of heterogeneous capabilities and propose a mathematical program for finding optimal solutions. Due to the very limited scalability caused by the large attacker's strategy space and non-linearity of the program, we investigate solutions with approximated utility function and propose Grande, a novel polynomial approximate al- gorithm utilizing submodularity of the problem able to find solutions with a bounded error on problem of a realistic size.

Druh

D - Stať ve sborníku

CEP obor

JC - Počítačový hardware a software

OECD FORD obor

—

Projekt

<a href="/cs/project/LH11051" target="_blank" >LH11051: Formální modely a efektivní algoritmy pro inteligentní ochranu dopravní infrastruktury.</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2012

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems

ISBN

978-0-9817381-2-3

ISSN

—

e-ISSN

—

Počet stran výsledku

8

Strana od-do

905-912

Název nakladatele

IFAAMAS

Místo vydání

County of Richland

Místo konání akce

Valencia

Datum konání akce

4. 6. 2012

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—