EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Congestion-Aware Adaptive Routing Based on Graph Attention Networks and Dynamic Cost Optimization

Jun Liu, Xinwei Li, Lingyun Zhou

Symmetry · 24.04.2026 · 18 (5) · 719

DOI: 10.3390/sym18050719 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Symmetry, online erschienen am 24.04.2026. Verfasst von Jun Liu und 2 weiteren Autor:innen. Die Arbeit nennt 31 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Natural Science Foundation of China, National Key Laboratory of Wireless Communications Foundation.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

To mitigate local congestion and address the adaptability limitations of traditional static routing under dynamic traffic, this paper proposes an end-to-end routing method based on a Graph Attention Network (GAT), termed Congestion-Aware Graph Attention Routing (CA-GAR). To alleviate the issue of local optima in traditional heuristic iterative optimization, we design a dynamic link cost optimization algorithm with multi-start parallel exploration. This algorithm employs a ”penalty–reselection–reward” closed-loop feedback mechanism, performing global searches from multiple random initial states to generate a high-quality, empirically near-optimal cost matrix as supervised labels. Building on this, CA-GAR leverages a multi-head attention mechanism to adaptively aggregate high-order topological features of nodes and edges, and incorporates a staged hierarchical hyperparameter optimization strategy to map real-time network states to link costs. Simulation results demonstrate that CA-GAR outperforms traditional static routing under light, medium, and heavy loads. Under high-load burst conditions, the method exhibits effective congestion avoidance capability, reducing end-to-end delay by approximately 50% and lowering the packet loss rate to as low as 2%. Compared with QLRA, CA-GAR shows promising performance in multi-path traffic splitting and possesses robust fast rerouting capabilities during node failures, thereby achieving intelligent traffic distribution and global load balancing.

Förderung

  • National Natural Science Foundation of China
  • National Key Laboratory of Wireless Communications Foundation

Zitieren

APA

Liu, J., Li, X., & Zhou, L. (2026). Congestion-Aware Adaptive Routing Based on Graph Attention Networks and Dynamic Cost Optimization. Symmetry, 18(5), 719. https://doi.org/10.3390/sym18050719

Vancouver

Liu J, Li X, Zhou L. Congestion-Aware Adaptive Routing Based on Graph Attention Networks and Dynamic Cost Optimization. Symmetry. 2026;18(5):719. doi:10.3390/sym18050719

BibTeX
@article{Liu2026,
  author = {Liu, Jun and Li, Xinwei and Zhou, Lingyun},
  title = {Congestion-Aware Adaptive Routing Based on Graph Attention Networks and Dynamic Cost Optimization},
  journal = {Symmetry},
  year = {2026},
  volume = {18},
  number = {5},
  pages = {719},
  doi = {10.3390/sym18050719}
}
Kostenlos starten →