The problem of the optimal placing of the information-technological backup in distributed data processing systems

It is noted, that information-technological backup is a new type of information redundancy, the use of which in distributed automated informational control systems allows to increase the efficiency of their performance while processing the typical user requests. The task of optimal allocation of identical copies of information-technological backup throughout the nodes of the distributed system is formulated in the form of a minisum problem of finding the $p$-median of a graph. The algorithm is proposed for solving this problem and the example of the solution is given. The brief analysis of the solution algorithm results is performed.