Abstract
Distributed Traffic Engineering (TE) aims to optimize network performance by generating individual routing strategies at each router without a global view of the network. A major challenge for these TE solutions is handling performance degradation caused by unexpected traffic fluctuations and unpredictable link failures. Recently, Machine Learning (ML) techniques have introduced new opportunities to enhance distributed TE. In this paper, we propose Path-Based Graph Neural Network (PathGNN), which leverages the emerging GNN architecture to quickly infer robust and resilient routing strategies in a distributed manner to accommodate unexpected network conditions. PathGNN adopts a novel path-link bipartite graph modeling approach to capture the dynamics of link resources shared by routing paths. It then performs efficient GNN message exchanges among routers to make adaptive local routing decisions for better load balancing. Additionally, PathGNN leverages Supervised Learning (SL) to directly learn from optimal routing strategies through efficient offline training. Evaluation results on four real-world network topologies demonstrate PathGNN's strong generalization capability. Compared to state-of-The-Art distributed TE solutions, PathGNN improves the load balancing performance by at least 24.4% with lower end-To-end delay under dynamic traffic scenarios, and also boosts performance by up to 35.3% under multiple link failures.
Original language | English |
---|---|
Pages (from-to) | 422-436 |
Number of pages | 15 |
Journal | IEEE Journal on Selected Areas in Communications |
Volume | 43 |
Issue number | 2 |
DOIs | |
Publication status | Published - 2025 |
Keywords
- bipartite graph modeling
- graph neural network
- routing
- supervised learning
- Traffic engineering