International Journal of Computer Network and Information Security (IJCNIS)
IJCNIS Vol. 17, No. 4, 8 Aug. 2025
Cover page and Table of Contents: PDF (size: 525KB)
Finding Optimal Routes in Internal Routing Networks based on a Modified Dijkstra’s Algorithm
PDF (525KB), PP.37-47
Views: 0 Downloads: 0
Author(s)
Borys Riabenko
1,*
Oksana Martynova
1
Yuliia Boiarinova
1
Arkadii Krainosvit
1
Index Terms
Dijkstra’s Algorithm, Computer Networks, Routing, Multipath Routing, Network Traffic, Route Optimization, OSPF, IGP, Load Balancing
Abstract
Modern communication networks face significant challenges due to the constant growth of traffic volumes and the need to effectively manage network resources. Standard routing protocols based on finding a single shortest path can lead to uneven load distribution and limit the overall throughput. One of the promising approaches to solving these problems is multi-path routing, which allows the use of multiple available paths for data transmission. In this paper, we propose a modification of the Dijkstra’s algorithm that extends the classical approach to find a set of optimal routes in a single algorithm run. The developed modification allows forming not only the main tree of shortest paths, but also additional trees of alternative routes, saving them based on certain conditions.
Cite This Paper
Borys Riabenko, Oksana Martynova, Yuliia Boiarinova, Arkadii Krainosvit, "Finding Optimal Routes in Internal Routing Networks based on a Modified Dijkstra’s Algorithm", International Journal of Computer Network and Information Security(IJCNIS), Vol.17, No.4, pp.37-47, 2025. DOI:10.5815/ijcnis.2025.04.03
Reference
[1]M. Feknous, T. Houdoin, B. Le Guyader, J. De Biasio, A. Gravey and J. A. T. Gijón, "Internet traffic analysis: A case study from two major European operators," 2014 IEEE Symposium on Computers and Communications (ISCC), Funchal, 2014, pp. 1-7
[2]Y. Xue, D. Wang and L. Zhang, "Traffic classification: Issues and challenges," 2013 International Conference on Computing, Networking and Communications (ICNC), San Diego, CA, USA, 2013, pp. 545-549
[3]Subhrananda Goswami, Sukumar Mondal, Subhankar Joardar, Sovan Samanta, Chandan Bikash Das, "Fuzzy-based Bi-objective Energy Efficient Routing Protocol for Large Scale Mobile Ad-hoc Network", International Journal of Intelligent Systems and Applications, Vol.16, No.6, pp.94-104, 2024.
[4]RFC 2328. Internet Official Protocol Standards. OSPF Version 2. [April 1998].
[5]Sabda, Syaifuddin & Azis, Muhamad & Sumadi, Fauzi. (2021, May). Comparison Analysis of Multipath Routing Implementation in Software Defined Network. Kinetik: Game Technology, Information System, Computer Network, Computing, Electronics, and Control.
[6]Suprith Kumar K. S., Eesha D., Pooja A. P., Monika Sharma D., "Heuristic – Driven Disjoint Alternate Path Switching – Based Fault Resilient Multi- Constraints Routing Protocol for SDN-mIOT", International Journal of Wireless and Microwave Technologies, Vol.14, No.5, pp. 12-30, 2024.
[7]L. Lan, L. Li and C. Jianya, (2012, October). A Multipath Routing Algorithm Based on OSPF Routing Protocol, 2012 Eighth International Conference on Semantics, Knowledge and Grids, Beijing, China, 2012, pp. 269-272
[8]Suprith Kumar K. S., Eesha D., Pooja A. P., Monika Sharma D., "Heuristic – Driven Disjoint Alternate Path Switching – Based Fault Resilient Multi- Constraints Routing Protocol for SDN-mIOT", International Journal of Wireless and Microwave Technologies, Vol.14, No.5, pp. 12-30, 2024.
[9]RFC 8218. Internet Official Protocol Standards. Multipath Extension for the Optimized Link State Routing Protocol Version 2 (OLSRv2). [August 2017].
[10]Akhilesh A. Waoo, Sanjay Sharma, Manjhari Jain, "Optimal Route Based Advanced Algorithm using Hot Link Split Multi-Path Routing Algorithm", International Journal of Computer Network and Information Security, vol.6, no.8, pp.48-55, 2014.
[11]Bi Yu Chen, Xiao-Wei Chen, Hui-Ping Chen, William H.K. Lam, Efficient algorithm for finding k shortest paths based on re-optimization technique, Transportation Research Part E: Logistics and Transportation Review, Volume 133, 2020, 101819, ISSN 1366-5545.
[12]Y. Li, L. Li and C. Wang, "A Multipath Routing Algorithm Based on Link Multi-metrics for Wireless Sensor Networks," 2008 ISECS International Colloquium on Computing, Communication, Control, and Management, Guangzhou, China, 2008, pp. 567-571
[13]Shun Liu and Jian Liu, "Delay-aware multipath source routing protocol to providing QoS support for wireless ad hoc networks," 2010 IEEE 12th International Conference on Communication Technology, Nanjing, 2010, pp. 1340-1343
[14]N. Farrugia, J. A. Briffa and V. Buttigieg, "An Evolutionary Multipath Routing Algorithm using SDN," 2018 9th International Conference on the Network of the Future (NOF), Poznan, Poland, 2018, pp. 1-8
[15]Kudtarkar, R. Sonkusare and D. Ambawade, "A spindle graph based singular multipath routing using Labelle Merging Algorithm," 2014 International Conference on Control, Instrumentation, Communication and Computational Technologies (ICCICCT), Kanyakumari, India, 2014, pp. 234-239
[16]Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001). "Section 24.3: Dijkstra's algorithm". Introduction to Algorithms (Second ed.). MIT Press and McGraw–Hill. pp. 595–601.