Mathematical Model of Calculating the Maximum Number of Disjoint Paths in Secure Routing

In this paper, the mathematical model of calculating the maximum number of disjoint paths in secure routing in the infocommunication network is presented. The task of calculating the maximum number of disjoint paths was reduced to solving the optimization problem of integer programming with maximization the number of paths in the presence of linear constraints, since the routing variables are Boolean, and variables that determine the number of routes used take only integer values. Using the maximum number of paths in a fragmented transmission of a secret message allows minimizing its probability of compromise.