Task Migration in LEO Satellite Networks: A Multi-Agent Reinforcement Learning Approach

Low Earth orbit satellite edge computing (LEO-SEC) networks, equipped with edge servers, provide computational and storage services to users globally, thereby reducing service latency. However, the stochastic nature of tasks and the heterogeneity of resources can result in load imbalances among satellites, adversely affecting user experience and system stability. Therefore, studying the issue of task migration in LEO-SEC networks is crucial. This paper investigates the task migration problem between LEO satellites, considering load imbalance and the dynamic nature of LEO-SEC networks. The problem is modeled as an integer programming (IP) problem. To solve it, we develop a multi-agent Markov decision process (MAMDP) and propose a migration approach based on the multi-agent proximal policy optimization (MAPPO) algorithm. Simulation results demonstrate the convergence performance of the proposed method and show that it outperforms baseline schemes in terms of efficiency and effectiveness.

Authors

Institutions

Publication Details

Published
2024-12-13
DOI
https://doi.org/10.1109/iccc62609.2024.10942178
Primary Topic
Satellite Communication Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Task Migration in LEO Satellite Networks: A Multi-Agent Reinforcement Learning Approach

Linling Kuang, Sheng Wu, Hang Zhang, Yuanjing Ma et al.
Satellite Communication Systems
article

Task Migration in LEO Satellite Networks: A Multi-Agent Reinforcement Learning Approach

Linling Kuang, Sheng Wu, Hang Zhang, Yuanjing Ma, Zhe Ji
article en

Abstract

Low Earth orbit satellite edge computing (LEO-SEC) networks, equipped with edge servers, provide computational and storage services to users globally, thereby reducing service latency. However, the stochastic nature of tasks and the heterogeneity of resources can result in load imbalances among satellites, adversely affecting user experience and system stability. Therefore, studying the issue of task migration in LEO-SEC networks is crucial. This paper investigates the task migration problem between LEO satellites, considering load imbalance and the dynamic nature of LEO-SEC networks. The problem is modeled as an integer programming (IP) problem. To solve it, we develop a multi-agent Markov decision process (MAMDP) and propose a migration approach based on the multi-agent proximal policy optimization (MAPPO) algorithm. Simulation results demonstrate the convergence performance of the proposed method and show that it outperforms baseline schemes in terms of efficiency and effectiveness.

Beijing University of Posts and Telecommunications (CN), Northwestern Polytechnical University (CN), Tsinghua University (CN)
Reduced inequalities
Openalex Percentile: Top 53%
Satellite Communication Systems
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.