Deep Learning Based Path Weight Prediction for Complex Network Routing

Basim Jamil Ali, Mohannad Ali Meteab Al-Obaidi, Hassan Hadi Salih and Moamin A Mahmoud

References:

1. W. Fan, Y. Ma, Q. Li, Y. He, E. Zhao, J. Tang, and D. Yin, “Graph neural networks for social recommendation,” in Proc. World Wide Web Conf., San Francisco, CA, USA, pp. 417–426, 2019, doi: 10.1145/3308558.3313488.
2. D. P. Sangeetha, S. Sekar, P. R. Parvathy, T. R. GaneshBabu, and M. Muthulekshmi, “Optimizing shortest paths in big data using the Floyd-Warshall algorithm,” in Proc. 2025 Int. Conf. Intelligent Control, Computing and Communication (IC3), Mathura, India, pp. 382–387, 2025, doi: 10.1109/IC363308.2025.10957179.
3. D. Cullina and N. Kiyavash, “Improved achievability and converse bounds for Erdős-Rényi graph matching,” ACM SIGMETRICS Performance Evaluation Review, vol. 44, no. 1, pp. 63–72, 2016, doi: 10.1145/2964791.2901460.
4. T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in Proc. Int. Conf. Learning Representations (ICLR), Toulon, France, Apr. 2017, doi: 10.48550/arXiv.1609.02907.
5. Z. Wu, S. Pan, F. Chen, G. Long, C. Zhang, and P. S. Yu, “A comprehensive survey on graph neural networks,” IEEE Transactions on Neural Networks and Learning Systems, vol. 32, no. 1, pp. 4–24, 2020, doi: 10.1109/TNNLS.2020.2978386.
6. W. Jiang, H. Han, Y. Zhang, J. A. Wang, M. He, W. Gu, and X. Cheng, “Graph neural networks for routing optimization: Challenges and opportunities,” Sustainability, vol. 16, no. 21, Art. no. 9239, 2024, doi: 10.3390/su16219239.
7. D. Liu, J. Zhang, J. Cui, S. X. Ng, R. G. Maunder, and L. Hanzo, “Deep-learning-aided packet routing in aeronautical ad hoc networks relying on real flight data: From single-objective to near-Pareto multiobjective optimization,” IEEE Internet of Things Journal, vol. 9, no. 6, pp. 4598–4614, 2022, doi: 10.1109/JIOT.2021.3105357.
8. J. You, R. Ying, X. Ren, W. Hamilton, and J. Leskovec, “GraphRNN: Generating realistic graphs with deep auto-regressive models,” in Proc. 35th Int. Conf. Machine Learning (ICML), Stockholm, Sweden, Jul. 2018, pp. 5708–5717, doi: 10.48550/arXiv.1802.08773.
9. Y. Liu, P. Zhang, Y. Gao, C. Zhou, Z. Li, and H. Chen, “Combinatorial optimization with automated graph neural networks,” arXiv preprint arXiv:2406.02872, 2024, doi: 10.48550/arXiv.2406.02872.
10. D. Pugacheva, A. Ermakov, I. Lyskov, I. Makarov, and Y. Zotov, “Enhancing GNNs performance on combinatorial optimization by recurrent feature update,” arXiv preprint arXiv:2407.16468, 2024, doi: 10.48550/arXiv.2407.16468.
11. Z. Nezami, K. Zamanifar, K. Djemame, and E. Pournaras, “Decentralized edge-to-cloud load balancing: Service placement for the Internet of Things,” IEEE Access, vol. 9, pp. 64983–65000, 2021, doi: 10.1109/ACCESS.2021.3074962.
12. M. Fabris, “Distributed optimization strategies for mobile multi-agent systems,” Ph.D. dissertation, University of Padua, Padua, Italy, 2019.
13. M. D. Tache, O. Păscuțoiu, and E. Borcoci, “Optimization algorithms in SDN: Routing, load balancing, and delay optimization,” Applied Sciences, vol. 14, no. 14, Art. no. 5967, 2024, doi: 10.3390/app14145967.
14. M. L. Bertotti and G. Modanese, “The Bass diffusion model on finite Barabási-Albert networks,” Complexity, vol. 2019, Art. no. 6352657, 2019, doi: 10.1155/2019/6352657.
15. M. L. Bertotti and G. Modanese, “The configuration model for Barabási-Albert networks,” Applied Network Science, vol. 4, no. 1, p. 32, 2019, doi: 10.1007/s41109-019-0152-1.
16. E. Pang, E. Nijkamp, and Y. N. Wu, “Deep learning with TensorFlow: A review,” Journal of Educational and Behavioral Statistics, vol. 45, no. 2, pp. 227–248, 2020, doi: 10.3102/1076998619872761.
17. J. Moolayil and S. John, Learn Keras for Deep Neural Networks. Birmingham, U.K.: Apress, 2019.
18. A. Hagberg and D. Conway, NetworkX: Network Analysis with Python, ver. 2.x, 2020. [Online]. Available: https://networkx.github.io.