Scheduling algorithms for high-throughput packet data service in cellular radio systems
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
This paper examines the performance of a number of scheduling algorithms for the wireless packet data access evolution of third-generation cellular systems. The algorithms are analyzed using three different wireless channel models (two pedestrian, one vehicular). For each channel model, a comparison of the performance of the algorithms using outdated channel state information plus margins tuned to provide an average 1% packet error rate, as well as using perfect channel prediction in order to determine the supportable bit rate and transmission format for each user, has been carried out. The performance of the algorithms is evaluated in terms of the average throughput per sector as a function of the number of users. The average delay per packet and per user versus the number of users per sector and the distributions of allocated slots per user are also determined as a measure of the fairness of each algorithm. It is also shown that the use of outdated information and margins can be an effective substitute for prediction, provided that the outdated measurements are reasonably accurate.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| 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.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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 it