A method of secure network traffic routing based on specified criterias

Authors

  • Valerii Nazarevych Institute of Special Communication and Information Protection of the National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute”, Kyiv, Ukraine https://orcid.org/0009-0007-9721-1101
  • Artem Mykytiuk Institute of Special Communication and Information Protection of the National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute”, Kyiv, Ukraine https://orcid.org/0000-0002-8307-9978
  • Olha Shevchuk Institute of Special Communication and Information Protection of the National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute”, Kyiv, Ukraine https://orcid.org/0000-0002-2866-439X
  • Ihor Kulyk Institute of Special Communication and Information Protection of the National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute”, Kyiv, Ukraine https://orcid.org/0009-0004-4565-6270

DOI:

https://doi.org/10.20535/2411-1031.2023.11.2.293752

Keywords:

routing, metric, telemetry, TWAMP, shortest path search algorithm

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.

Author Biographies

Valerii Nazarevych, Institute of Special Communication and Information Protection of the National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute”, Kyiv

senior laboratory engineer at the state cybersecurity and application of information systems and technologies academic department

Artem Mykytiuk, Institute of Special Communication and Information Protection of the National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute”, Kyiv

deputy head of the cybersecurity and application of information systems and technologies academic department

Olha Shevchuk, Institute of Special Communication and Information Protection of the National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute”, Kyiv

lecturer at the state cybersecurity and application of information systems and technologies academic department

Ihor Kulyk, Institute of Special Communication and Information Protection of the National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute”, Kyiv

student

References

E. V. Vavilov, “Factors influencing the quality indicators of information and communication networks”, in Proc. All-Ukr. science conf. of grad. stud. and young scient. Harmonization of society - the newest direction of state development, Odesa, 2014, pp. 7-10.

S. D. Pohorily, and R. V. Bilous, “Genetic Algorithm for Solving Routing Problems in Networks”, Programming Problems, no. 2-3 pp. 171-177, 2010.

R. M. Desai, B. P. Patil, and D. P. Sharma, “Learning based route management in mobile ad hoc networks”, Indonesian Journal of Electrical Engineering and Computer Sciencec, vol. 7, no. 3, pp. 718-723, 2017, doi: https://doi.org/10.11591/ijeecs.v7.i3.

F. Safari, I. Savić, H. Kunze, J. Ernst, and D. Gillis, “A review of ai-based MANET routing protocols”, in Proc. 2023 19th Int. Conf. Wireless Mobile Computing, Netw. Commun. (WiMob), Montreal, QC, Canada, June 21-23, 2023. IEEE, 2023. doi: https://doi.org/10.1109/wimob58348.2023.10187830.

O. V. Lemeshko, Flow models and methods of routing in information communication networks: fault tolerance, security, scalability: monograph. Kharkiv, Ukraine: KhNURE, 2020.

K. Ergun, R. Ayoub, P. Mercati, and T. Rosing, “Reinforcement learning based reliability-aware routing in IoT networks”, Ad Hoc Netw., vol. 132, art. 102869, July 2022. doi: https://doi.org/10.1016/j.adhoc.2022.102869.

V. M. Bezruk, and K. R. Galchenko, “A multi-criteria approach to optimal routing in communication networks”, in Science-intensive optimization and control technologies in information communication networks, V. M. Bezruk, L. S. Globa, and О. E. Stryzha, Eds, Kyiv, Ukraine, 2019, pp. 83-96.

O. V. Lemeshko, et al., “Modeling and optimization of safe and fault-tolerant routing processes in telecommunication networks: monograph”, Kharkiv, Ukraine: KhNURE, 2022. doi: https://doi.org/10.30837/978-966-659-378-1.

S. Salnyk, A. Storchak, and A. Mykytiuk, “Communication system information resource security breach model”, Information technology and security, vol. 7, no. 1. pp. 25-34, 2019. doi: https://doi.org/10.20535/2411-1031.2019.7.1.184217.

O. V. Solovyov, “A method for optimizing the operation of a VoIP network based on the selection of a voice call route”, PhD thesis, National Aviation University, 2020. [Online]. Available: https://er.nau.edu.ua/handle/NAU/44450. Accessed on: Sep. 4, 2023.

H. Liao, and L. B. Kara, “Reinforcement learning for routing”, in Machine Learning Applications in Electronic Design Automation. Cham: Springer International Publishing, 2022, pp. 277-306. doi: https://doi.org/10.1007/978-3-031-13074-8_11.

V. Paxson, “End-to-end routing behavior in the internet”, ACM SIGCOMM Comput. Communication Rev., vol. 36, no 5, pp. 41-56, Oct. 2006. doi: https://doi.org/10.1145/1163593.1163602.

M. Al. Jameel, T. Kanakis, S. Turner, A. Al-Sherbaz, and W. S. Bhaya, “A reinforcement learning-based routing for real-time multimedia traffic transmission over software-defined networking”, Electronics, vol. 11, no 15, art. 2441, Sept. 2022. doi: https://doi.org/10.3390/electronics11152441.

B. C. Chatterjee, N. Sarma, and P. P. Sahu, “Priority based routing and wavelength assignment with traffic grooming for optical networks”, J. Opt. Commun. Netw., vol. 4, is. 6, pp. 480-489, May 2012. doi: https://doi.org/10.1364/jocn.4.000480.

K. T. Chen, C. C. Tu, and W. C. Xiao, “OneClick: A Framework for Measuring Network Quality of Experience”, in Proc. 2009 IEEE INFOCOM, Rio De Janeiro, Brazil, April, 19-25, 2009. IEEE, 2009, pp. 702-710. doi: https://doi.org/10.1109/infcom.2009.5061978.

J. Liu et al., “EAGLE: Heterogeneous GNN-based Network Performance Analysis”, in Proc. 2023 IEEE/ACM 31st Int. Symp. Qual. Service (IWQoS), Orlando, FL, USA, June, 19-21, 2023. 10 p. IEEE, 2023. doi: https://doi.org/10.1109/iwqos57198.2023.10188804.

K. Hedayat, R. Krzanowski, A. Morton, K. Yum, and J. Babiarz, “RFC 5357: A Two-Way Active Measurement Protocol (TWAMP)”, RFC Editor, Oct. 2008. doi: https://doi.org/10.17487/rfc5357.

K. Ramasamy, and D. Medhi, Network Routing: Algorithms, Protocols, and Architectures. Elsevier Science & Technology Books, 2017.

K. H. Rosen, Discrete Mathematics and Its Applications, NY, USA: McGraw-Hill Companies, 2012.

Y. V. Nikolsky, V. V. Pasichnyk, and Yu. M. Shcherbina, “Discrete Mathematics”, Kyiv, Ukraine: BHV Publishing Group, 2007.

Downloads

Published

2023-12-28

How to Cite

Nazarevych, V., Mykytiuk, A., Shevchuk, O., & Kulyk, I. (2023). A method of secure network traffic routing based on specified criterias . Collection "Information Technology and Security", 11(2), 156–165. https://doi.org/10.20535/2411-1031.2023.11.2.293752

Issue

Vol. 11 No. 2 (2023)

Section

NETWORK AND APPLICATION SECURITY

License

Copyright (c) 2023 Collection "Information Technology and Security"

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

The authors that are published in this collection, agree to the following terms:

  1. The authors reserve the right to authorship of their work and pass the collection right of first publication this work is licensed under the Creative Commons Attribution License, which allows others to freely distribute the published work with the obligatory reference to the authors of the original work and the first publication of the work in this collection.
     
  2. The authors have the right to conclude an agreement on exclusive distribution of the work in the form in which it was published this anthology (for example, to place the work in a digital repository institution or to publish in the structure of the monograph), provided that references to the first publication of the work in this collection.
     
  3. Policy of the journal allows and encourages the placement of authors on the Internet (for example, in storage facilities or on personal web sites) the manuscript of the work, prior to the submission of the manuscript to the editor, and during its editorial processing, as it contributes to productive scientific discussion and positive effect on the efficiency and dynamics of citations of published work (see The Effect of Open Access).