Reinforcement Learning Based Control Domain Division in LEO Satellite Networks
Bibliographic record
Abstract
The performance of SDN-based LEO satellite networks significantly depends on the control domain division approaches. The dynamical topology in LEO networks results in the time-varying delay for network management. Therefore, the control domain division is very challenging and should be dynamical. In this paper, we propose a control domain division approach based on reinforcement learning (RL), which aims at reducing the average management delay of controllers during the control period, and as well as minimizing the number of control domain handovers. Firstly, we analyze the factors that need to be paid attention to in controller deployment, such as delay, load and controller switching cost, and formulate the controller deployment. By relaxing the constraints, we prove that the problem is NP-hard. Secondly, we propose an approach that considers future motion trajectory based on reinforcement learning (FMT _ RL) to deploy controllers. Since the dimension of the neural network in reinforcement learning is fixed, we use the improved K-Means algorithm to select the set of mechanisms to determine the dimension of the neural network. Particularly, in order to obtain the node composition control domain, the observation including both future motion trajectory and history controller selection information are input into the neural network to calculate the control domain division results. The experimental results demonstrate that our approach significantly outperforms related approaches, with better stability and average control cost.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".