Comparisons of link-adaptation-based scheduling algorithms for the WCDMA system with high-speed downlink packet access
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
The wideband code division multiple access (WCDMA) system with high-speed downlink packet access (HSDPA) is an important next-generation wireless system. By adopting adaptive modulation, efficient scheduling, and hybrid automatic repeat request technologies, it can support data rates of up to 10 Mb/s in the mobile cellular environment. Among these techniques, the scheduling algorithm plays a key role in realizing the HSDPA concept. A good scheduling algorithm should consider all the important factors, including channel impact, delay issues, and fairness. In this paper, a fairness index is adopted to examine the fairness performance of current link-adaptation-based scheduling algorithms, including the maximum carrier-to-interference (C/I), round-robin, proportional fair, and exponential rule schedulers. It is found that when multi-type services are supported, the fairness performance of current scheduling algorithms, including the round-robin scheduler, can be further improved even though the round-robin scheduler is viewed as the scheduler of the greatest fairness. Thus, a new scheduling algorithm, namely the queue-based exponential rule scheduler, is developed. Through simulations, it is shown that in the context of multi-type services the fairness performance of the queue-based exponential rule scheduler can surpass that of all the other schedulers in the time-multiplexing fashion, while maintaining good throughput and delay performance.
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