FORMULATION OF THE PROBLEM OF OPTIMIZING THE STRUCTURE OF LOCAL COMPUTER NETWORKS

Terskov Vitaly, Sakash Irina

The article describes the formulation of the problem of optimizing the structure of local computer networks. The features of the presented problem that influence the choice of optimization methods are investigated. The conclusion is written that this problem can be effectively solved using evolutionary optimization methods. With the help of currently existing performance models, it is possible to determine the minimum hardware configuration of the structure of a local computer network. The method proposed in this article allows you to find configurations that have hardware redundancy (compared to the minimum configuration), but, due to this, having a greater probability of being in states that provide sufficient performance to achieve the goals of the functioning of the designed system. This method is more flexible than simply duplicating all hardware components of a minimal configuration, This can be used to reduce the cost of creating and operating the designed system. The described model can be used to increase the performance of local computer networks. At the same time, it should be taken into account that the resources allocated for the creation and operation of local computer networks are always limited. Therefore, it is reasonable to consider the task of optimizing performance, which has two criteria: the first criterion is performance, and the second is the cost of creating a local computer network.

Keywords:local computer networks, model, performance, queuing theory.