Task-Oriented Service Provision and Scheduling for Non-Terrestrial Networks: A Deep Reinforcement Learning Based Approach

The non-terrestrial network (NTN) receives considerable attentions due to the development of the sixth generation technologies in recent years. However, the mobility and heterogeneity of satellites and unmanned aerial vehicles in NTN lead to increasing challenges in resource allocation and management. As such, the network function virtualization technology is introduced, by deploying service function chains (SFCs) to achieve requirements. However, it brings conflicts and resource competition due to urgent unexpected tasks. Therefore, scheduling multiple SFCs in NTN is a crucial issue. In this paper, a task-oriented service provision and scheduling model is proposed to tackle the dynamic complexity of NTN by designing the reconfigurable time extension graph. Subsequently, the SFC scheduling problem is formulated to maximize the number of completed tasks within limited resources and time constraints. Due to the problem form of integer linear programming, we propose a deep reinforcement learning based algorithm. Finally, simulation results validate the effectiveness of the proposed algorithm, indicating its superior performance over other benchmark algorithms.

Authors

Institutions

Publication Details

Published
2024-10-24
DOI
https://doi.org/10.1109/wcsp62071.2024.10826922
Citations
2
Primary Topic
IoT and Edge/Fog Computing
Type
article
Field-Weighted Citation Impact
0.70

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Task-Oriented Service Provision and Scheduling for Non-Terrestrial Networks: A Deep Reinforcement Learning Based Approach

Fuhui Zhou, Chao Dong, Yilu Cao, Yu Zhang et al.
2 citations
IoT and Edge/Fog Computing
0.70
article

Task-Oriented Service Provision and Scheduling for Non-Terrestrial Networks: A Deep Reinforcement Learning Based Approach

Fuhui Zhou, Chao Dong, Yilu Cao, Yu Zhang, Qihui Wu, Ziye Jia
article en
2 citations

Abstract

The non-terrestrial network (NTN) receives considerable attentions due to the development of the sixth generation technologies in recent years. However, the mobility and heterogeneity of satellites and unmanned aerial vehicles in NTN lead to increasing challenges in resource allocation and management. As such, the network function virtualization technology is introduced, by deploying service function chains (SFCs) to achieve requirements. However, it brings conflicts and resource competition due to urgent unexpected tasks. Therefore, scheduling multiple SFCs in NTN is a crucial issue. In this paper, a task-oriented service provision and scheduling model is proposed to tackle the dynamic complexity of NTN by designing the reconfigurable time extension graph. Subsequently, the SFC scheduling problem is formulated to maximize the number of completed tasks within limited resources and time constraints. Due to the problem form of integer linear programming, we propose a deep reinforcement learning based algorithm. Finally, simulation results validate the effectiveness of the proposed algorithm, indicating its superior performance over other benchmark algorithms.

Newcastle University (GB), Ministry of Industry and Information Technology (CN), Nanjing University of Aeronautics and Astronautics (CN)
National Natural Science Foundation of China, Natural Science Foundation of Jiangsu Province, Young Elite Scientists Sponsorship Program by Tianjin, National Mobile Communications Research Laboratory, Southeast University
Openalex Percentile: Top 25%
IoT and Edge/Fog Computing
0.70
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.