Joint Routing and Scheduling Optimization in Time-Sensitive Networks Using Graph-Convolutional-Network-Based Deep Reinforcement Learning

被引:42
作者
Yang, Liu [1 ]
Wei, Yifei [1 ]
Yu, F. Richard [2 ]
Han, Zhu [3 ,4 ]
机构
[1] Beijing Univ Posts & Telecommun, Sch Elect Engn, Beijing 100876, Peoples R China
[2] Carleton Univ, Dept Syst & Comp Engn, Ottawa, ON K1S 5B6, Canada
[3] Univ Houston, Dept Elect & Comp Engn, Houston, TX 77004 USA
[4] Kyung Hee Univ, Dept Comp Sci & Engn, Seoul 446701, South Korea
基金
中国国家自然科学基金;
关键词
Deep reinforcement learning (DRL); graph convolutional network (GCN); joint routing and scheduling; time-sensitive networking (TSN); worst case end-to-end latency;
D O I
10.1109/JIOT.2022.3188826
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The growing number of Internet of Things (IoT) devices brings enormous time-sensitive applications, which require real-time transmission to effectuate communication services. The ultrareliable and low-latency communication (URLLC) scenario in the fifth generation (5G) has played a critical role in supporting services with delay-sensitive properties. Time-sensitive networking (TSN) has been widely considered as a promising paradigm for enabling the deterministic transmission guarantees for 5G. However, TSN is a hybrid traffic system with time-sensitive traffic and best effort traffic, which require effective routing and scheduling to provide a deterministic and bounded delay. While joint optimization of time-sensitive and non-time-sensitive traffic greatly increases the solution space and brings a significant challenge to obtain solutions. Therefore, this article proposes a graph convolutional network-based deep reinforcement learning (GCN-based DRL) solution for the joint optimization problem in practical communication scenarios. The GCN is integrated into deep reinforcement learning (DRL) to obtain the network's spatial dependence and elevate the generalization performance of the proposed method. Specifically, the GCN adopts the first-order Chebyshev polynomial to approximate the graph convolution kernel, which reduces the complexity of the algorithm and improves the feasibility for the joint optimization task. Furthermore, priority experience replay is employed to accelerate the convergence speed of the model training process. Numerical simulations demonstrate that the proposed GCN-based DRL algorithm has good convergence and outperforms the benchmark methods in terms of the average end-to-end delay.
引用
收藏
页码:23981 / 23994
页数:14
相关论文
共 46 条
[41]   Virtualized Network Function Forwarding Graph Placing in SDN and NFV-Enabled IoT Networks: A Graph Neural Network Assisted Deep Reinforcement Learning Method [J].
Xie, Yanghao ;
Huang, Lin ;
Kong, Yuyang ;
Wang, Sheng ;
Xu, Shizhong ;
Wang, Xiong ;
Ren, Jing .
IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, 2022, 19 (01) :524-537
[42]   Optimal and Approximation Algorithms for Joint Routing and Scheduling in Millimeter-Wave Cellular Networks [J].
Yuan, Dingwen ;
Lin, Hsuan-Yin ;
Widmer, Jorg ;
Hollick, Matthias .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2020, 28 (05) :2188-2202
[43]   Delay-aware Cellular Traffic Scheduling with Deep Reinforcement Learning [J].
Zhang, Ticao ;
Shen, Shuyi ;
Mao, Shiwen ;
Chang, Gee-Kung .
2020 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2020,
[44]   Worst-Case Latency Analysis for IEEE 802.1Qbv Time Sensitive Networks Using Network Calculus [J].
Zhao, Luxi ;
Pop, Paul ;
Craciunas, Silviu S. .
IEEE ACCESS, 2018, 6 :41803-41815
[45]   GCLR: GNN-Based Cross Layer Optimization for Multipath TCP by Routing [J].
Zhu, Ting ;
Chen, Xiaohui ;
Chen, Li ;
Wang, Weidong ;
Wei, Guo .
IEEE ACCESS, 2020, 8 :17060-17070
[46]   Adaptive and Robust Routing With Lyapunov-Based Deep RL in MEC Networks Enabled by Blockchains [J].
Zhuang, Zirui ;
Wang, Jingyu ;
Qi, Qi ;
Liao, Jianxin ;
Han, Zhu .
IEEE INTERNET OF THINGS JOURNAL, 2021, 8 (04) :2208-2225