A method of secure network traffic routing based on specified criterias

Abstract

Due to the implementation of new network services, the increase amount of data that need to be transmitted, and the use of networks in various sectors with diverse communication requirements, there is a need to develop new approaches to ensure the quality of such communications. Leading network equipment manufacturers and standardization organizations are developing new routing algorithms, resulting in the introduction of new routing protocols or improvements to existing ones. However, all these algorithms cover routing principles for general-purpose networks and do not consider the communication requirements of specialized networks. Therefore, the task arises to research optimization directions for network traffic routing, define optimization criteria, and further develop a method for secure network traffic routing based on the specified criteria. In this work, a routing method is proposed that takes into account the defined requirements when searching for the optimal route. In the case of dynamic routing, each router calculates the shortest routes to all other networks based on the shortest path search algorithm. This work defines a method for calculating metrics based on specified criteria and formally describes the algorithm for finding the shortest path. Quality of communication criteria is introduced, which will enable meeting communication requirements in specialized networks. Calculation methods for these criteria are demonstrated, and data collection methods for the calculation of specified criteria are determined. A formula for calculating metrics is proposed, which includes the possibility of selecting T-values and determining their numerical parameters to prioritize specific criteria. Default values for criteria are defined, and metric calculations are tested by default for different types of interfaces. After calculating metrics, the task reduces to finding the shortest paths in a weighted graph using an algorithm based on Dijkstra's algorithm. The proposed algorithm for finding the shortest path involves identifying the primary (shortest) and backup paths from a given source vertex to all other graph vertices. A formal description of the proposed algorithm is provided.