The impact of GNN architecture on the robustness of edge routes in scenarios of single node types

Keywords: Software-defined networks (SDN), Graph neural networks (GNN), Reinforcement learning, Intelligent routing, GCN, GAT, Q-Learning, Quality of service (QoS), Fault tolerance, Adaptive traffic management

Abstract

The paper considers the problem of intelligent routing (path finding) in software-defined networks (SDN) using graph neural networks in order to increase the efficiency of network resource use and adapt to dynamic changes in the network state (for example, channel congestion or delays).

Topicality. Modern software-defined networks (SDN) are faced with increasing traffic volumes and increased quality of service (QoS) requirements. Traditional routing algorithms (e.g. Dijkstra) are static and inefficient in conditions of high load dynamics or sudden topology changes (hardware failures). This leads to channel congestion, increased latency, and packet loss. The use of machine learning methods, in particular graph neural networks (GNN) and reinforcement learning (RL), opens up new opportunities for creating adaptive intelligent agents capable of optimizing routing in real time, which makes this research timely and important for the development of telecommunication systems.

Goal. The aim of the research is to improve the efficiency and reliability of data transmission in SDN networks by developing and comparative analysis of intelligent routing methods. The main focus is on the study of graph neural network architectures (GCN, GAT) and the Q-Learning algorithm to provide adaptive traffic management under conditions of variable load and network node failures.

Research methods. The methodological basis of the work is based on the integrated application of graph theory to formalize the network topology, deep learning methods to process node features, and reinforcement learning algorithms to make routing decisions. Experimental verification of the proposed approaches was carried out by emulating a software-configured network in the Mininet environment under the control of the Ryu controller. The software implementation included the development of models based on convolutional networks (GCN) and attention networks (GAT) using deep learning libraries, as well as the implementation of the Deep Q-Learning agent. The effectiveness of the algorithms was assessed by comparative analysis of key quality of service metrics - throughput, average latency, and packet loss percentage - in scenarios of gradual load growth and emergency topology change due to equipment failure.

The results. The study found that the integration of machine learning methods allows for significant improvements in data transmission parameters compared to the classic Dijkstra algorithm, especially in high traffic conditions, where intelligent agents provide lower latency and connection stability. Critical analysis of fault tolerance revealed significant differences between the studied architectures: the GCN model demonstrated limited adaptability with a routing failure rate of 30%, while the GAT architecture showed better flexibility, generating optimal paths in half of the cases. The highest efficiency was confirmed by the Q-Learning method, which, thanks to dynamic interaction with the environment, ensured the construction of ideal routes in 85% of experiments and minimized packet loss to 5–7% even in critical situations, which proves the superiority of Reinforcement Learning approaches over Supervised Learning methods in adaptive network control tasks.

Downloads

Download data is not yet available.

Author Biographies

Denys Turchak, V. N. Karazin Kharkiv National University, Svobody Square, 4, Kharkiv, 61022

Postgraduate student of the Department of Applied Mathematics

Kyrylo Rukkas, V. N. Karazin Kharkiv National University, Svobody Square, 4, Kharkiv, 61022

Doctor of Technical Sciences, Associate Professor

References

Rusek K., et al. RouteNet: Leveraging Graph Neural Networks for network modeling and optimization. IEEE Journal on Selected Areas in Communications. 2020. Vol. 38, no. 10. P. 2260–2270. DOI: 10.1109/JSAC.2020.3000405.

Ferriol-Galmés M., et al. RouteNet-Erlang: A Graph Neural Network for Network Performance Evaluation. IEEE INFOCOM 2022 - IEEE Conference on Computer Communications. 2022. P. 2018–2027. DOI: 10.1109/INFOCOM48030.2022.9796677.

Mammeri A. A Survey on Machine Learning Techniques for Routing Optimization in SDN. IEEE Access. 2021. Vol. 9. P. 104523–104544. DOI: 10.1109/ACCESS.2021.3098763.

Stampa G., et al. A Deep Reinforcement Learning Approach for Software-Defined Networking Routing Optimization. IEEE International Conference on Communications (ICC). 2019. P. 1–6. DOI: 10.1109/ICC.2019.8761479.

Zheng S., Huang H., GNN et al. Research on Generalized Intelligent Routing Technology Based on Deep Reinforcement Learning. Electronics. 2022. Vol. 11, no. 3. P. 343. DOI: 10.3390/electronics11030343.

Ferriol-Galmés M., Barlet-Ros P., Cabellos-Aparicio A. RouteNet-Fermi: Network Modeling with Graph Neural Networks. IEEE/ACM Transactions on Networking. 2024. Vol. 32, no. 3. P. 1200–1215. DOI: 10.1109/TNET.2024.3392336.

Wu W., et al. Neural Algorithmic Reasoners informed Large Language Model for Multi-Agent Path Finding (LLM-NAR). arXiv preprint arXiv:2508.17971. 2025. URL: https://arxiv.org/abs/2508.17971 (дата звернення: 28.01.2026).

Islam M., et al. Results analysis on the cyber layer of the IEEE 39-bus test system under both normal and failure condition. IEEE Access. 2024. Vol. 12. P. 106234–106245. DOI: 10.1109/ACCESS.2024.10623446.

Grace: Toward Routing in Dynamic Network Environments With Graph Embedding. IEEE Transactions on Networking. 2025. DOI: 10.1109/TNET.2025.11078667.

Published
2026-03-30
How to Cite
Turchak, D., & Rukkas, K. (2026). The impact of GNN architecture on the robustness of edge routes in scenarios of single node types. Bulletin of V.N. Karazin Kharkiv National University, Series «Mathematical Modeling. Information Technology. Automated Control Systems», 69, 101-110. https://doi.org/10.26565/2304-6201-2026-69-08
Section
Статті