MétaCan
Menu
Back to cohort
Record W2808116623 · doi:10.1109/wcnc.2018.8377370

Efficient loss-aware uplink scheduling

2018· article· en· W2808116623 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Network Optimization
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsGoodputTelecommunications linkComputer scienceScheduling (production processes)Computer networkBenchmark (surveying)Real-time computingMathematical optimizationTelecommunicationsWirelessThroughputMathematics

Abstract

fetched live from OpenAlex

Uplink scheduling in cellular networks is challenging due to power and interference management. Typically, each cell performs local scheduling, which requires estimation of inter-cell interference (ICI) to compute the appropriate modulation and coding scheme (MCS) based on the Signal-to-Interference-plus-Noise-Ratio (SINR) for each allocated resource block. Since schedules of neighboring cells are unknown to schedulers, the SINR can be badly estimated, which causes resource losses or under-utilization. The benchmark uplink scheduler we study in this paper produces a high goodput at the cost of significant resource losses, because it does not take the possibility of losses into account. Resource losses imply retransmissions, hence, high variability in delay. Therefore, a scheduler should be evaluated in terms of its goodput/loss trade-off. We propose a novel uplink scheduler that is inspired by Soft Frequency Reuse (SFR) and uses an MCS selection that takes the probability of losses into account, i.e., it selects an MCS that maximizes the effective rates seen by users, while keeping the loss probability below a threshold e. We show that the proposed scheduler yields significantly better goodput/loss trade-off than the benchmark scheduler.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.849
Threshold uncertainty score0.389

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.006
GPT teacher head0.218
Teacher spread0.212 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations5
Published2018
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Wireless Network OptimizationFrench-language works237,207