Optimal Network Security Hardening Using Attack Graph Games

Authors: Karel Durkota, Viliam Lisý, Branislav Bošanský, Christopher Kiekintveld

IJCAI 2015 | Conference PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Experimental We present an empirical evaluation of the model and solution algorithms, evaluating scalability, the types of solutions that are generated for realistic cases, and sensitivity analysis.
Researcher Affiliation Academia 1Agent Technology Center, Dept. of Computer Science, FEE, Czech Technical University in Prague {durkota,lisy}@agents.fel.cvut.cz 2Department of Computer Science, Aarhus University bosansky@cs.au.dk 3Computer Science Department, University of Texas at El Paso cdkiekintveld@utep.edu
Pseudocode No The paper describes algorithms and concepts but does not include any structured pseudocode or algorithm blocks.
Open Source Code No The paper mentions using existing tools (Mul VAL, GUIDO, SPUDD) but does not state that the authors are providing open-source code for their own described methodology.
Open Datasets No The paper states that 'Attack graphs for the experiments were generated with Mul VAL [Ou et al., 2005] tool' and 'Network topologies for experiments are depicted in Fig. 1c (Main-i), 1d (Local-i) and 1e (Local+i)', indicating generated data rather than a publicly available dataset with a concrete access method.
Dataset Splits No The paper discusses the generation of attack graphs and network topologies for experiments but does not provide specific train/validation/test dataset splits for reproducibility.
Hardware Specification Yes All experiments were run on one core of Intel i7 3.5GHz processor with 10GB memory limit.
Software Dependencies No The paper mentions using 'Mul VAL [Ou et al., 2005] tool', 'GUIDO [Isa et al., 2007]', and 'SPUDD [Hoey et al., 1999]' but does not provide specific version numbers for these software components or any other libraries/environments.
Experiment Setup Yes Attacker’s actions costs in AG are set randomly between 1 and 100. The rewards for compromising the host types are 1000 for workstations (ws), 2000 for vpn, 2500 for server (srv) and 5000 for database (db). ... The defender pays chp(t) = γlt for adding honeypot of type t, where γ [0,1] is parameter we alter.