Задача выбора вычислительных процессов, обеспечивающих защиту информации, для серверов распределенной системы и алгоритмы ее решения

Abstract

Purpose: providing information security on servers of various destinations of an automated system based on the formulation of an optimization task setting for selecting auxiliary processes for information protection, developing and researching algorithms for solving this problem. Method: To solve the problem, the authors propose two exact algorithms for incomplete search with exponential computational complexity, based on the ideas of the Balash method. One algorithm starts with a solution consisting of all ones, and the second algorithm starts with a solution consisting of all zeros. Also proposed are two approximate algorithms with polynomial complexity, based on the ideas of the “greedy” algorithm, one algorithm starts the search from a zero solution, the other from all-one solution. Result: Mathematical model and algorithms for solving the problem of selecting processes to protect information in conditions of limited computing resources of servers. The process selection model is a Boolean programming problem with a non-linear quality indicator and linear constraints. The indicator provides an estimate of the damage prevented when using the selected processes, taking into account the probability or possibility of various attacks on servers, the value of stored data, and the probability of protection from attacks using processes. During the experiments, recommendations were developed for choosing one of two algorithms (search starting from the zero solution and search starting from all-one solution) among pairs of exact and approximate algorithms depending on the availability of resources in order to reduce the time to solve the problem.