Game-theoretic Resource Allocation for Malicious Packet Detection in Computer Networks
The result's identifiers
Result code in 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>
Result on the web
<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
—
Alternative languages
Result language
angličtina
Original language name
Game-theoretic Resource Allocation for Malicious Packet Detection in Computer Networks
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/LH11051" target="_blank" >LH11051: Formal models and effective algorithms for the intelligent protection of transport infrastructures.</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems
ISBN
978-0-9817381-2-3
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
905-912
Publisher name
IFAAMAS
Place of publication
County of Richland
Event location
Valencia
Event date
Jun 4, 2012
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—