Performance Analysis and Improvement Methods for Channel Resource Management Strategies of LEO–MSS With Multiparty Traffic
Bibliographic record
Abstract
A novel analytical framework for the accurate and efficient evaluation of the performance of channel resource management strategies for low Earth orbit mobile satellite systems (LEO-MSSs) supporting multiparty traffic is presented. By considering a fixed channel reservation (FCR) scheme as a benchmark, an efficient and accurate analytical approach is developed for obtaining the performance of multiparty traffic under various quality-of-service (QoS) performance measure criteria. The proposed approach is based on a Markovian queuing model, and its correctness and accuracy have been verified by means of computer simulations. To improve the overall performance of LEO-MSS, two novel resource management techniques are introduced and analyzed. The first one is an efficient adaptive channel reservation (ACR) scheme, which allows priority to be given to handover requests that are generated by multiparty traffic. The second one is a new call queuing (NCQ) policy, which efficiently reduces the new call blocking probability with little impact on other system performance measures, such as call dropping probability and unsuccessful call probability. Various performance results show that when ACR is used in conjunction with NCQ, extremely low blocking and handover failure probabilities can be achieved for multiparty traffic.
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.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| 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.002 | 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".