Network traffic routing algorithm taking into account safety requirements

The paper presents the solution of the classical task of optimal routing of network flow, when as a criterion for optimizing not the delay time but the probability of information security breaches in the process of data transfer is taken. Thus, unlike many other works on routing comprising security restrictions, the proposed criterion of safety also depends on the delay time. This criterion relates to the probability of service security breach of the data packet during its transmission through the channels. The initial data of the model are the adjacency matrix of the graph describing the topology of the network, channel capacity and the matrix of gravitation, which describes the relative volume of data transmitted for various network couples. The proposed routing method is a method of deflection of flow, when the final result of the implementation of the method is not a listing of specific transmission routes but the volume of data transmitted for each channel at an optimum routing. In the process of the formation of alternative transmission methods Floyd’s method, a method of formation of shortest route matrix, is used. This formulation of the routing problem is mostly adequate to the requirements of security of data transmission in the network. The preliminary analysis is made and the correlations for all characteristics, used when implementing the method in the network, such as time delay for each channel, the length of the packet (message) and the desired target function, are obtained. Direct routing algorithm is similar to the algorithm of Kleinrock routing. The algorithm can be simply modified, if necessary, taking into account additional restrictions of any kind — the composition of the transmission routes, the transmission conditions and individual limits for each channel.