A Comparative Study of OSPF Metrics in Routing Algorithms for Dynamic Path Selection in Network Security
Article Sidebar
Main Article Content
Abstract
Open-path first (OSPF) algorithms optimize paths using shortest-path metrics, often overlooking security considerations and adaptability in dynamic network environments. Many OSPF implementations use fixed cost values that do not adapt to network conditions. Research is needed to develop adaptive cost functions that dynamically respond to security threats. This paper compares cost metrics in OSPF routing algorithms to evaluate their effectiveness in dynamic path selection within network security contexts. By incorporating diverse cost functions and assessing their performance across security conditions, this study seeks to identify metrics that evaluate performance. To achieve this, OSPF routing algorithms were analyzed using different cost metrics, including step, linear, and exponential functions. Through simulations, the algorithms were tested under a Barabási-Albert topology, from routine operations to threat-prone scenarios, to evaluate their capabilities in dynamic path selection and resilience against security threats. The numerical results highlight a trade-off among the step, linear, and exponential cost functions, with average delays of 0.553 ms, 0.653 ms, and 0.517 ms, respectively, and average jitters of 0.210 μs, 0.201 μs, and 0.205 μs. The packet delivery success (PDS) rates are also recorded at 87.64%, 86.76%, and 86.18% for the step, linear, and exponential cost functions, respectively. This approach facilitates an analysis aimed at balancing performance with security considerations.
Article Details
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
References
Moy, J. OSPF: Anatomy of an internet routing protocol; Addison-Wesley, 1998.
Devir, N.; Grumberg, O.; Markovitch, S.; Nakibly, G. Topology-agnostic runtime detection of ospf routing attacks. In Proceedings of the 2019 IEEE Conf. Commun. Netw. Secur. (CNS), Washington, DC, USA, 2019, 277–285. https://doi.org/10.1109/CNS.2019.8802826.
Meredith, R.; Dutta, R. Increasing Network Resilience to Persistent OSPF Attacks. In Proceedings of the 2019 IEEE Int. Conf. Commun. (ICC), Shanghai, China, 2019, 1–7. https://doi.org/10.1109/ICC.2019.8761838.
Nakibly, G.; Sosnovich, A.; Menahem, E.; Waizel, A.; Elovici, Y. OSPF Vulnerability to Persistent Poisoning Attacks: A Systematic Analysis. In Proceedings of the 30th Annual Computer Security Applications Conference (ACSAC '14), New York, NY, USA, 2014, 336–345. https://doi.org/10.1145/2664243.2664278.
Al-Musawi, B.; Branch, P.; Hassan, M. F.; Pokhrel, S. R. Identifying OSPF LSA Falsification Attacks through Non-linear Analysis. Comput. Netw., 2020, 167, 107031. https://doi.org/10.1016/j.comnet.2019.107031.
Basu, A.; Riecke, J. Stability Issues in OSPF Routing. ACM SIGCOMM Comput. Commun. Rev., 2001, 31(4), 225–236. https://doi.org//10.1145/964723.383077.
Rétvári, G.; Németh, F.; Chaparadza, R.; Szabó, R. OSPF for Implementing Self-adaptive Routing in Autonomic Networks: A Case Study. In Modelling Autonomic Communications Environments, Strassner, J. C.; Ghamri-Doudane, Y. M., Eds.; Lecture Notes in Computer Science; Springer: Berlin, Heidelberg, 2009, 5844, 78-89. https://doi.org/10.1007/978-3-642-05006-0_6.
Bahnasse, A., Louhab, F.E., Khiat, A., Badri, A., Talea, M., and Pandey, B. Smart Hybrid SDN Approach for MPLS VPN Management and Adaptive Multipath Optimal Routing. Wireless Pers Commun., 2020, 114, 1107–1131, https://doi.org//10.1007/s11277-020-07411-1
Mehraban, S.; Yadav, R. K. Traffic Engineering and Quality of Service in Hybrid Software Defined Networks. China Commun., 2024, 21(2), 96–121. https://doi.org/10.23919/JCC.fa.2022-0860.202402
Yazdinejad, A.; Parizi, R. M.; Dehghantanha, A.; Srivastava, G.; Mohan, S.; Rababah, A. M. Cost Optimization of Secure Routing with Untrusted Devices in Software Defined Networking. J. Parallel Distrib. Comput., 2020, 143, 36–46, https://doi.org//10.1016/j.jpdc.2020.03.021.
Bi, Y.; Han, G.; Lin, C.; Peng, Y.; Pu, H.; Jia, Y. Intelligent Quality of Service Aware Traffic Forwarding for Software-Defined Networking/Open Shortest Path First Hybrid Industrial Internet. IEEE Trans. Ind. Inform. 2020, 16(2), 1395–1405. https://doi.org/10.1109/TII.2019.2946045.
Ramkumar, J., Vadivel, R. Multi-Adaptive Routing Protocol for Internet of Things based Ad-hoc Networks. Wireless Pers Commun., 2021, 120, 887–909. https://doi.org/10.1007/s11277-021-08495-z
Singh, K.; Moh, S. Routing Protocols in Cognitive Radio Ad Hoc Networks: A Comprehensive Review. J. Netw. Comput. Appl., 2016, 72, 28–37. https://doi.org/10.1016/j.jnca.2016.07.006.
Mahamune, A. A.; Chandane, M. M. Trust-Based Co-operative Routing for Secure Communication in Mobile Ad Hoc Networks. Digit. Commun. Netw., 2024, 10(4), 1079–1087. https://doi.org/10.1016/j.dcan.2023.01.005.
Manivannan, D.; Moni, S. S.; Zeadally, S. Secure Authentication and Privacy-Preserving Techniques in Vehicular Ad-hoc Networks (VANETs). Vehic. Commun., 2020, 25, 100247. https://doi.org/10.1016/j.vehcom.2020.100247.
Lemeshko, O.; Yevdokymenko, M.; Shapoval, M. Routing Model with Load Balancing on the Traffic Engineering Principles based on Information Security Risks. In Proceedings of IEEE Int. Conf. Probl. Infocommun. Sci. Technol. (PIC S&T), Kharkiv, Ukraine, 2021, 572–576. https://doi.org/10.1109/PICST54195.2021.9772193.
Lemeshko, O.; Yeremenko, O.; Yevdokymenko, M.; Shapovalova, A.; Lemeshko, V.; Persikov, M. Analysis of Secure Routing Processes Using Traffic Engineering Model. In Proceedings of the IEEE Int. Conf. Intell. Data Acquis. Adv. Comput. Syst. (IDAACS), Cracow, Poland, 2021, 951–955. https://doi.org/10.1109/IDAACS53288.2021.9660980.