Vel'c

In this paper a mathematical model based on directed graphs was presented. This model allows one to apply a quantitative approach to risk assessment and vulnerability detection in information networks, which is an important step during the security system design. A utility function and a heuristic for informed memory-bounded search SMA* algorithm were also proposed. These results could be used for security audit and countermeasures planning.

The problem of hierarchical representation of a computer network for carrying out its multiscale analysis was considered. An original problem was reduced to the known set cover problem (SCP). Since this problem is NP-difficult, approximate heuristic techniques were useful for its solving. We proposed an algorithm based on the recurrent Hopfield neural network and its combination with the simulated annealing algorithm (so-called Boltzmann machine). A greedy algorithm was used for a construction of hierarchy levels. This approach was evaluated with a use of the test problems from OR-Library. Proposed approach could be used in the systems of traffic analysis and anomaly detection in computer networks.