Enhanced Solution of the Disjoint Paths Set Calculation for Secure QoS Routing

In this paper, the enhanced solution of the disjoint paths set calculation for Secure QoS Routing in the infocommunication network is presented. The task stated was reduced to solving the optimization problem of integer linear programming with maximization of the number of paths and their bandwidth along with minimization of the probability of their compromising 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. The presented solution is proposed for using in SDN based networks.