MétaCan
Menu
Back to cohort
Record W1536395336 · doi:10.1002/cpe.1892

A performance evaluation framework for packet scheduling algorithms in wireless system

2011· article· en· W1536395336 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

VenueConcurrency and Computation Practice and Experience · 2011
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Network Optimization
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsComputer scienceMaximum throughput schedulingNetwork packetScheduling (production processes)Round-robin schedulingAlgorithmWirelessFair-share schedulingDistributed computingComputer networkMathematical optimizationQuality of serviceMathematicsTelecommunications

Abstract

fetched live from OpenAlex

SUMMARY The question of how to evaluate wireless packet scheduling algorithms with a comprehensive consideration of different performance metrics is investigated in this paper. By studying the intrinsic relationship between system throughput and fairness, a performance evaluation problem for packet scheduling algorithms in a wireless system is formulated. Through the use of nonlinear programming method, the performance evaluation framework for weighted‐type packet scheduling algorithms can be established. The performances of some typical packet scheduling algorithms for multiuser wireless communications are also evaluated in this framework as examples. Copyright © 2011 John Wiley & Sons, Ltd.

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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.789
Threshold uncertainty score0.488

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.001
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.045
GPT teacher head0.317
Teacher spread0.273 · 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