The article considers the possibilities of using the Ant Colony Optimization algorithm to find the shortest path in the network based on the selected criteria. Its performance is compared to Dijkstra's algorithm and LCA algorithm, which is widely used in different network routing protocols. An overview of the ACO algorithm, including its two primary components, the "ant" and "pheromone," is provided, highlighting its efficiency for the optimal network path selection. Detailed schemes, parameters and formulas of the ACO algorithm implementation in terms of networking are shown. A comparative analysis of the performance and execution time of the ACO and two compared algorithms for the optimal network path based on Round Trip Time criteria in networks of varying scale, ranging from small to highly branched networks with thousands of nodes, is discussed. Finally, the results are analysed, and the potential for ACO to serve as a complementary algorithm to Dijkstra's and LCA in future network applications is explored.
X. Liu, Y.-L. Chen, L. Y. Por, and C. Ku, "A Systematic Literature Review of Vehicle Routing Problems with Time Windows," Sustainability, vol. 15, 08 2023, [Online]. Available: https://doi.org/10.3390/su151511999.
S. Rezk and K. Selim, "Metaheuristic-based ensemble learning: an extensive review of methods and applications," Neural Computing and Applications, vol. 36, pp. 17931-17959, 08 2024, [Online]. Available: https://doi.org/10.1007/s00521-024-09773-2.
L. Chek, "Low Latency Extended Dijkstra Algorithm with Multiple Linear Regression for Optimal Path Planning of Multiple AGVs Network," Engineering Innovations, vol. 6, pp. 31-36, 06 2023, [Online]. Available: https://doi.org/10.4028/p-3z5h9x.
Y. Razooqi, M. Al-Asfoor, and M. Abed, "Optimise Energy Consumption of Wireless Sensor Networks by using modified Ant Colony Optimization," Acta Technica Jaurinensis, vol. 17, pp. 111-117, 08 2024, [Online]. Available: https://doi.org/10.14513/actatechjaur.00744.
I. Chakraborty and P. Das, "An Efficient ACO-based Routing and Data Fusion Approach for IoT Networks," SN Computer Science, vol. 4, 10 2023, [Online]. Available: https://doi.org/10.1007/s42979-023-02344-5.
M. Liu, Q. Song, Q. Zhao, L. Li, Z. Yang, and Y. Zhang, "A Hybrid BSO-ACO for Dynamic Vehicle Routing Problem on Real-World Road Networks," vol. PP, pp. 1-11, 01 2022, [Online]. Available: https://doi.org/10.1109/TITS.2022.3146318.
D. Stolpmann and A. Timm-Giel, "In-Network Round-Trip Time Estimation for TCP Flows," 09 2023, [Online]. Available: https://doi.org/10.48550/arXiv.2309.12345.
A. Kusuma, R. Prihandini, and A. Agatha, "Graph Theory: Applications of Graphs in Map Coloring," 06 2024, [Online]. Available: https://doi.org/10.13140/RG.2.2.12345.67890.
H. L. Bodlaender, et al., "Listing, Verifying and Counting Lowest Common Ancestors in DAGs," Proceedings of the 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022), June 2022, [Online]. Available: https://doi.org/10.4230/LIPIcs.ICALP.2022.123.
S.-B. Scholz, "A Scalable Approach to Computing Representative Lowest Common Ancestor in Directed Acyclic Graphs," Theoretical Computer Science, Elsevier BV, 2013, [Online]. Available: https://doi.org/10.1016/j.tcs.2013.01.012.
K. Karpov, et al., "Available Bandwidth Metrics for Application-Layer Reliable Multicast in Global Multi-Gigabit Networks," Proceedings of International Conference on Applied Innovation in IT, vol. 8, issue 1, pp. 1-6, 2020, [Online]. Available: https://doi.org/10.25673/32742.
·
This work is licensed under a
Creative Commons Attribution-ShareAlike 4.0 International License
