Joint Best Price-CQI Product Scheduling and Congestion Control for LTE
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
In hybrid wired-wireless media, congestion control and scheduling are both trying to allocate bandwidth to the flows. Performance studies of long-term evolution (LTE) networks show that by decreasing the mismatch between scheduling at the base station of an LTE network and congestion control algorithms implemented at end users, significant improvements in the obtained overall throughput and fairness for best-effort traffic are achieved. In this paper, a problem formulation for joint scheduling and congestion control based on dual problem optimization is provided for a hybrid media, which includes a wireless LTE network. The original optimization problem is decomposed into two subproblems: congestion control problem and link scheduling problem. We propose methods to solve and implement these subproblems in different layers of a hybrid network, and call the derived link scheduling subproblem best price-channel quality indicator (CQI) product scheduling. Then, the performance of the proposed joint algorithm for LTE is studied. The results show a better tradeoff between the overall throughput and the fairness for the joint algorithm compared with classic cases in which congestion control and scheduling are separately designed and implemented without any cooperation. The behavior of the proposed best price-CQI product scheduler and a common proportional fair scheduler is compared, and some notable similarities in the case of applying logarithmic utility functions are observed.
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