首页 >

低轨卫星网络中基于任务优先级的智能算力路由方法-“空天地一体化智能网联”专刊

庞贵梅1,2,那振宇1,2,刘文1,林彬1,郭庆3   

  1. 1. 大连海事大学
    2. 西安电子科技大学空天地一体化综合业务网全国重点实验室
    3. 哈尔滨工业大学通信技术研究所
  • 收稿日期:2026-03-30 修回日期:2026-06-20 出版日期:2026-06-23 发布日期:2026-06-23
  • 通讯作者: 那振宇
  • 基金资助:
    面向海事服务保障的通算融合网络资源部署与调度关键技术研究;面向广域应急通信的高空平台基站部署与资源配置协同优化

A Task-Priority-Based Intelligent Computing-Aware Routing Method for LEO Satellite Networks

  • Received:2026-03-30 Revised:2026-06-20 Online:2026-06-23 Published:2026-06-23
  • Contact: Zhenyu Na

摘要: 针对低轨卫星网络中数据传输面临的星地链路受限及任务服务质量异构需求等挑战,提出一种基于任务优先级的智能算力路由方法。首先,考虑卫星计算和存储资源,构建面向资源约束的低轨卫星网络模型,并引入日凌现象动态评估链路可用性,从而刻画空间环境扰动对路由决策的影响。其次,建立面向任务的服务质量分级与优先级调度机制,以刻画不同任务对时延和丢包率的需求。进一步地,建立以最小化端到端平均时延为目标的计算卸载与数据传输联合优化模型。最后,将该优化模型转化为马尔可夫决策过程,以支持强化学习求解。在任务计算与数据转发中引入任务优先级队列,并结合服务质量约束对候选动作空间进行动态筛选,同时在奖励函数中设置任务优先级权重,设计一种基于Dueling Double Deep Q-Network(Dueling-DDQN)的算力路由决策算法,实现计算卸载与路径选择的自适应优化。仿真结果表明,在288星座规模下,所提方法在高流量负载下相较于近端策略优化算法可使端到端平均时延降低4.28%-14.53%,任务计算比例提升1.44%-2.89%,并在不同星座规模中均保持良好的适用性。

关键词: 低轨卫星, 任务优先级, Dueling-DDQN, 算力路由, 时延优化

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.

Key words: low earth orbit satellite, task priority, dueling-DDQN, computing-aware routing, delay optimization

中图分类号: