Adaptive Network Management Service Based on Control Relation Graph for Software-Defined LEO Satellite Networks in 6G
Bibliographic record
Abstract
As the most important incremental component in the advent of the 6G era, Low-Earth-Orbit (LEO) satellite networks are becoming increasingly instrumental, and their integration with Software-Defined Networking (SDN) is progressively recognized as a potent strategy for evolving toward truly service-centric networks, where networks are flexiblely reconstructed based on the service demands. Within such networks, the SDN controllers are responsible for network management by making service-aware resource orchestration. Hence, the placement and assignment of controllers emerge as one of the most critical aspects of the network management service, which becomes particularly challenging when confronted with the unique complexities posed by LEO satellite networks, characterized by their highly dynamic topology and unpredictable load fluctuations. In this paper, for the first time, we tackle the issue of controller placement and assignment with a focus on delivering network management services. Firstly, we formulate theadaptive controller placement and assignmentproblem. Then, we propose thecontrol relation graph (CRG)to capture the control overhead. Next, we present theCRG-based controller placement and assignmentalgorithm and thesliding window based traffic prediction method. Thelookahead-based improvementalgorithm is designed to further decrease management costs. Finally, we conduct a series of theoretical analyses including time complexities. Extensive emulation results demonstrate that our algorithms outperform related schemes in terms of response time and load balancing.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 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.003 | 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".