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

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Game-theoretic Resource Allocation for Malicious Packet Detection in Computer Networks Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://dl.acm.org/citation.cfm?id=2343826
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-based security 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. 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-based security 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. (en)
Title	Game-theoretic Resource Allocation for Malicious Packet Detection in Computer Networks Game-theoretic Resource Allocation for Malicious Packet Detection in Computer Networks (en)
skos:prefLabel	Game-theoretic Resource Allocation for Malicious Packet Detection in Computer Networks Game-theoretic Resource Allocation for Malicious Packet Detection in Computer Networks (en)
skos:notation	RIV/68407700:21230/12:00195286!RIV13-MSM-21230___
http://linked.open...avai/predkladatel	Fakulta elektrotechnická
http://linked.open...avai/riv/aktivita	P S
http://linked.open...avai/riv/aktivity	P(LH11051), S
http://linked.open...vai/riv/dodaniDat	2013
http://linked.open...aciTvurceVysledku	Vaněk, Ondřej Pěchouček, Michal Bošanský, Branislav
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	České vysoké učení technické v Praze / Fakulta elektrotechnická
http://linked.open...dnocenehoVysledku	137701
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/12:00195286
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	computer networks; security; game-theory; approximation algorithm; submodularity (en)
http://linked.open.../riv/klicoveSlovo	computer networks security approximation algorithm game-theory submodularity
http://linked.open...ontrolniKodProRIV	[DCF5A190374E]
http://linked.open...v/mistoKonaniAkce	Valencia
http://linked.open...i/riv/mistoVydani	County of Richland
http://linked.open...i/riv/nazevZdroje	Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	6 (xsd:int)
http://linked.open...vavai/riv/projekt	Formal models and effective algorithms for the intelligent protection of transport infrastructures.
http://linked.open...UplatneniVysledku	2012
http://linked.open...iv/tvurceVysledku	Bošanský, Branislav Pěchouček, Michal Vaněk, Ondřej Jain, M. Tambe, M. Yin, Z.
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2012-06-04 (xsd:date)
number of pages	8 (xsd:int)
http://purl.org/ne...btex#hasPublisher	IFAAMAS
https://schema.org/isbn	978-0-9817381-2-3
http://localhost/t...ganizacniJednotka	21230
is http://linked.open...avai/riv/vysledek of	Game-theoretic Resource Allocation for Malicious Packet Detection in Computer Networks

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 46 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software