FlexSATE: Flexible and Distributed Traffic Engineering with Supervised Learning in Ultra-Dense Low-Earth-Orbit Satellite Networks
Bibliographic record
Abstract
The ultra-dense low earth orbit (UD-LEO) satellite network is being vigorously developed due to its great potential in providing global coverage and services. For the sake of improved network performance in resource-constrained satellite networks, multipath schemes are being explored. However, state-of-the-art multipath routing algorithms face the challenge when dealing with highly dynamic satellite network features (i.e., frequent traffic variation, link failures) and fail to exploit the simple grid topology to design fast yet efficient traffic engineering (TE) approaches. In this paper, we propose a novel distributed TE scheme called Flexible Satellite Traffic Engineering (FlexSATE), which leverages global path computation coupled with distributed local routing decisions to improve the overall load balancing performance for ultra-dense LEO satellite networks. By constructing a minimum-hop binary tree (MHBT), we propose an MHBT-based k-segment Routing algorithm, which is capable of promptly discovering routing paths with low latency, high diversity, and good load balancing. To further enhance network transmission performance, we employ supervised learning into dynamic rate adaption, where FlexSATE employs centralized offline learning to derive insights from the globally optimal routing strategy and utilizes distributed deployment to predict the optimal distribution of traffic in real time. Our simulation results on a real-world typical Walker-delta type LEO constellation with 720 satellites show that FlexSATE outperforms some existing approaches with superior robustness and flexibility.
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.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 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".