ANALYSIS OF METHODS FOR CALCULATING THE OSPF DYNAMIC ROUTING PROTOCOL METRIC CONSIDERING INFORMATION SECURITY RISK

Authors

DOI:

https://doi.org/10.28925/2663-4023.2025.29.914

Keywords:

ospf, routing, metric, information security, risk, telecommunication networks, cybersecurity

Abstract

This paper addresses the problem of improving the metrics of the OSPF dynamic routing protocol by incorporating information security risk. The standard OSPF metric is based solely on channel bandwidth and does not account for potential threats, which may compromise the confidentiality, integrity, or availability of data in telecommunication networks. Based on the analysis of recent research focused on secure routing, such as the use of trust mechanisms, cryptographic techniques, and machine learning algorithms, the feasibility of enhancing traditional approaches with risk indicators is substantiated. The study proposes three modified metric variants that integrate node and link risk levels into the routing decision process. To evaluate their effectiveness, a simulation was performed on a network topology with four routers, analyzing how optimal paths change under varying risk conditions. The results demonstrate that one of the proposed methods ensures the best balance between bandwidth efficiency and security, while others are either overly sensitive to risk or require careful parameter adjustment to be practical. The findings confirm the importance of including information security risk in the routing process, which significantly strengthens network resilience against cyberattacks and improves overall infrastructure reliability. Future work will focus on expanding the experimental base with diverse topologies and traffic parameters, as well as developing methods for optimal parameter tuning to balance the influence of risk in OSPF metrics.

Downloads

Download data is not yet available.

References

Moy, J. (1998). OSPF Version 2 (RFC 2328). Internet Engineering Task Force. https://doi.org/10.17487/RFC2328

Coltun, R., Ferguson, D., & Moy, J. (2008). OSPF for IPv6 (RFC 5340). Internet Engineering Task Force. https://doi.org/10.17487/RFC5340

Åkerberg, L., & Johansson Baurne, V. (2024). Practical analysis and simulation of OSPF protocol vulnerabilities (Master’s thesis). KTH Royal Institute of Technology.

Shahid, K., Ahmad, S. N., & Rizvi, S. T. H. (2024). Optimizing network performance: A comparative analysis of EIGRP, OSPF, and BGP in IPv6-based load-sharing and link-failover systems. Future Internet, 16(9), 339. https://doi.org/10.3390/fi1609033

Thaenchaikun, C., & Kanjanasit, K. (2025). A comparative study of OSPF metrics in routing algorithms for dynamic path selection in network security. ASEAN Journal of Science and Technology Report, 28(2), e256556. https://doi.org/10.55164/ajstr.v28i2.25655

Hassan, A., Sharma, R., & Singh, G. (2019). Preventing and isolating distributed denial of service (DDoS) attack in wireless mesh networks (WMNs). International Journal of Innovative Technology and Exploring Engineering, 8(9S), 447–452. https://doi.org/10.35940/ijitee.I1071.0789S1

Obelovska, K., Snaichuk, Y., Selecky, J., Liskevych, R., & Valkova, T. (2023). An approach toward packet routing in the OSPF-based network with a distrustful router. WSEAS Transactions on Information Science and Applications, 20(45), 432–441. https://doi.org/10.37394/23209.2023.20.45

Obelovska, K., Tkachuk, O., & Snaichuk, Y. (2024). Minimizing the number of distrustful nodes on the path of IP packet transmission. Computation, 12(5), 91. https://doi.org/10.3390/computation12050091

Obelovska, K., Snaichuk, Y., Liskevych, O., Mitoulis, S.-A., & Liskevych, R. (2025). Mitigation of risks associated with distrustful routers in OSPF networks – An enhanced method. Computers, 14(2), 43. https://doi.org/10.3390/computers14020043

Yeremenko, O. S., & Pliekhova, H. A. (2022). Doslidzhennia modelei bezpechnoi marshrutyzatsii na osnovi bazovykh metryk urazlyvostei u merezhakh SDN [Research of secure routing models based on basic vulnerability metrics in SDN networks]. Problemy Telekomunikatsii, 2(31), 34–41. http://pt.nure.ua/3

Maiba, M. A., & Yeremenko, O. S. (2023). Rozviazannia zadachi klasyfikatsii merezhnykh prystroiv na osnovi parametriv bezpeky za dopomohoiu mashynnoho navchannia [Solving the problem of classifying network devices based on security parameters using machine learning]. Problemy Telekomunikatsii, 2(33), 44–50. http://pt.nure.ua/3

Amin, R., Rojas, E., Aqdus, A., Ramzan, S., Casillas-Perez, D., & Arco, J. M. (2021). A survey on machine learning techniques for routing optimization in SDN. IEEE Access, 9, 104582–104604. https://doi.org/10.1109/ACCESS.2021.309909

Chakryan, V. Kh. (2017). Modeli ta metody marshrutyzatsii trafiku v telekomunikatsiinykh merezhakh z urakhuvanniam vymoh informatsiinoi bezpeky [Models and methods of traffic routing in telecommunication networks considering information security requirements] (PhD dissertation). Kharkiv National University of Radio Electronics.

Lemeshko, O. V., Yeremenko, O. S., & Yevdokymenko, M. O. (2021). Fault-tolerant multicast routing in an infocommunication network with path and bandwidth protection. Problems of Telecommunication, 1(28), 36–43. http://pt.nure.ua/28

Downloads


Abstract views: 4

Published

2025-09-26

How to Cite

Chakrian, V., Andrushko, D., Snihurov, A., & Pshenychnykh, S. (2025). ANALYSIS OF METHODS FOR CALCULATING THE OSPF DYNAMIC ROUTING PROTOCOL METRIC CONSIDERING INFORMATION SECURITY RISK. Electronic Professional Scientific Journal «Cybersecurity: Education, Science, Technique», 1(29), 598–608. https://doi.org/10.28925/2663-4023.2025.29.914