Using Genetic Algorithms for Deadline-Constrained Monitor Selection in Dynamic Computer Networks
Robin Mueller-Bady, Ruediger Gad, Martin Kappes, Inmaculada Medina‐Bulo · 2015
In this paper we address the problem of selecting a minimal number of optimally positioned monitors for capturing network traffic in dynamic computer network environments. Requirements of computer network monitoring change frequently, e.g., due to indicators of an ongoing attack, which requires a continuous optimization and adaptation of the monitoring state. The monitor selection problem can be mapped to the vertex cover problem which NP-complete. Therefore, we propose a genetic algorithm (GA) as optimization heuristic for obtaining an appropriate solution in adequate time.