TY - GEN
T1 - GAT-PPO-Based Joint Routing Optimization for TSN-Enabled VPP Backbone Networks
AU - Sun, Haochun
AU - Gan, Lei
AU - Yu, Kun
AU - Yang, Tianyu
AU - Yuan, Yubo
AU - Cao, Xiaodong
AU - Cheng, Hanmiao
AU - Wang, Zhongdong
N1 - Publisher Copyright:
© 2026 IEEE.
PY - 2026
Y1 - 2026
N2 - As virtual power plants continue to scale and time-sensitive services increase, wide-area backbone networks face stricter requirements for low latency, high reliability, and efficient transmission. Existing VPP backbones have difficulty sustaining stable end-to-end quality of service under dynamic mixed traffic and time-varying loads. To address this issue, this paper proposes a joint routing and scheduling optimization method for VPP wide-area backbone networks based on graph attention networks and proximal policy optimization, while incorporating a dynamic priority-sorting mechanism under cyclic queuing and forwarding constraints. The problem is formulated as a Markov decision process, where graph attention is used to extract local topology and link-state features, and proximal policy optimization enables hop-by-hop online routing decisions, thereby improving transmission adaptability in dynamic scenarios. Simulation results show that the proposed method outperforms baseline schemes in average end-to-end latency, packet loss ratio, and effective throughput, while also exhibiting favorable convergence performance.
AB - As virtual power plants continue to scale and time-sensitive services increase, wide-area backbone networks face stricter requirements for low latency, high reliability, and efficient transmission. Existing VPP backbones have difficulty sustaining stable end-to-end quality of service under dynamic mixed traffic and time-varying loads. To address this issue, this paper proposes a joint routing and scheduling optimization method for VPP wide-area backbone networks based on graph attention networks and proximal policy optimization, while incorporating a dynamic priority-sorting mechanism under cyclic queuing and forwarding constraints. The problem is formulated as a Markov decision process, where graph attention is used to extract local topology and link-state features, and proximal policy optimization enables hop-by-hop online routing decisions, thereby improving transmission adaptability in dynamic scenarios. Simulation results show that the proposed method outperforms baseline schemes in average end-to-end latency, packet loss ratio, and effective throughput, while also exhibiting favorable convergence performance.
KW - graph attention network (GAT)
KW - joint routing
KW - proximal policy optimization (PPO)
KW - scheduling
KW - time-sensitive networking (TSN)
KW - Virtual Power Plant (VPP)
UR - https://www.scopus.com/pages/publications/105048886338
U2 - 10.1109/AAIEE69872.2026.11649867
DO - 10.1109/AAIEE69872.2026.11649867
M3 - 会议稿件
AN - SCOPUS:105048886338
T3 - 2026 IEEE 2nd International Symposium on the Application of Artificial Intelligence in Electrical Engineering, AAIEE 2026
SP - 498
EP - 504
BT - 2026 IEEE 2nd International Symposium on the Application of Artificial Intelligence in Electrical Engineering, AAIEE 2026
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2nd IEEE International Symposium on the Application of Artificial Intelligence in Electrical Engineering, AAIEE 2026
Y2 - 10 April 2026 through 13 April 2026
ER -