System of Solutions the Maximum Number of Disjoint Paths Computation Under Quality of Service and Security Parameters

Abstract

The paper proposes a system of solutions to the maximum number of disjoint paths computation under the Quality of Service and security parameters. The field of application of the calculation models the set of disjoint paths has been explained during the provision of the network capabilities such as Quality of Service (QoS) and Network Security by the means of the OSI Network Layer, namely routing and traffic management protocols and technological solutions. Here secure routing means aimed at improving network security in terms of the probability of compromising the transmitted confidential data. Towards improving network performance and providing the demanded level of QoS in the network, the QoS-based multipath routing with support of load balancing and Traffic Engineering concept is used. The basic mathematical model for calculating the maximum number of disjoint paths has been presented. The tasks stated were reduced to solving the optimization problems of integer and mixed integer linear programming with maximization of the number of paths and their bandwidth and minimization of their compromising probability 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 numerical examples demonstrate the adequacy of the proposed system of solutions in terms of the correctness of the obtained calculation results.