AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (6.7 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Publishing Language: Chinese

A task-priority-based intelligent computing-aware routing method for LEO satellite networks

Guimei PANG1,2, Zhenyu NA1,2( ), Wen LIU1, Bin LIN1, Qing GUO3
School of Information Science and Technology, Dalian Maritime University, Dalian 116026, China
State Key Laboratory of Integrated Services Networks, Xidian University, Xi'an 710071, China
School of Electronics and Information Engineering, Harbin Institute of Technology, Harbin 150001, China
Show Author Information

Abstract

To address the challenges of limited satellite-ground bandwidth and heterogeneous Quality of Service (QoS) requirements for tasks in Low Earth Orbit (LEO) satellite networks, an intelligent computing-aware routing method based on task priority is proposed. First, considering satellite computing and storage resources, a resource-constrained LEO satellite network model is constructed. The sun outage phenomenon is incorporated to dynamically evaluate link availability, thereby capturing the impact of space environmental disturbances on routing decisions. Second, a QoS classification and priority scheduling mechanism is established to characterize the heterogeneous requirements of tasks in terms of latency and packet loss rate. Subsequently, a joint optimization model for computation offloading and data transmission is formulated with the objective of minimizing the end-to-end average delay. Furthermore, the optimization problem is transformed into a Markov Decision Process to enable reinforcement learning-based solutions. A task-priority queue is introduced in task processing and data forwarding, and QoS constraints are incorporated to dynamically filter candidate action space. Meanwhile, task-priority weights are embedded into the reward function. Based on these designs, a Dueling Double Deep Q-Network (Dueling-DDQN)-based computing-aware routing decision algorithm is designed to achieve adaptive optimization of computation offloading and routing decisions. Simulation results demonstrate that, under a constellation of 288 satellites, the proposed method outperforms the Proximal Policy Optimization algorithm under different traffic loads. In particular, the average end-to-end delay is reduced by 4.28%–14.53%, and the task computing ratio is increased by 1.44%–2.89%. Moreover, the proposed method maintains good applicability across different constellation scales.

CLC number: V474.2;TN927+.2 Document code: A Article ID: 1000-6893(2026)18-533624-17

References

【1】
【1】
 
 
Acta Aeronautica et Astronautica Sinica

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
PANG G, NA Z, LIU W, et al. A task-priority-based intelligent computing-aware routing method for LEO satellite networks. Acta Aeronautica et Astronautica Sinica, 2026, 47(18). https://doi.org/10.7527/S1000-6893.2026.33624

4

Views

0

Downloads

0

Crossref

0

Scopus

0

CSCD

Received: 30 March 2026
Revised: 27 April 2026
Accepted: 15 June 2026
Published: 24 June 2026
© 2026 The Journal of Acta Aeronautica et Astronautica Sinica