Proportional Fairness for MIMO Multi-user Schedulers with Traffic Arrival Process
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
Packet scheduling at the data link layer may impact significantly the overall performance of a wireless system using multiple antennas. In this paper, we propose a novel packet scheduling scheme based on proportional fairness that considers the traffic arrival process with different packet lengths for the downlink of multiple-input multiple-output (MIMO) multi-user systems. We also provide analysis for the fairness of the new scheme in terms of time and service allocation. The scheduler, referred to as clock-time proportional fairness (C-T PF), performs at the packet level and can provide low average packet transmission delay as well as time and service fairness to users. It is work conserving and it can also take into consideration different users guarantees (heterogeneous users). We investigate an ideal service fair scheduler called C-T max-min for MIMO systems as well. We compare the performance of C-T PF with other MIMO schedulers. For the time and service fairness comparison of MIMO schedulers, we also propose time and service indexes. Simulations that consider the traffic characteristics and the mobility of users show the low average packet transmission delay and demonstrate the time and service fairness capabilities of C-T PF.
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