MétaCan
Menu
Back to cohort
Record W2150082046 · doi:10.1109/cnsr.2006.34

Loan-Grant Based Round Robin Scheduling

2006· article· en· W2150082046 on OpenAlexaff
Akbar Ghaffarpour Rahbar, Ou Yang

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicNetwork Traffic and Congestion Control
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsComputer scienceComputer networkScheduling (production processes)Frame (networking)Network packetBandwidth (computing)Real-time computingLoanFinance

Abstract

fetched live from OpenAlex

We propose the Loan-Grant based Round Robin (LGRR) scheduler in the DiffServ domain. Traffic from all streams in all classes is carried in a logical frame. Each frame includes smaller rounds for each class, and only one packet can be transmitted from each stream inside a class in each round. A stream can transmit traffic in the frame when it has enough grants. Each stream inside a class first obtains some quantum from the scheduler according to its average arrival rate, bandwidth usage, and traffic status. Bursty streams can be processed quickly by requesting bandwidth loan from the scheduler. To control the amount of transmitted bits from each stream, the loan is paid back from the future acquired quantum. Our evaluation and comparison shows that our algorithm performs better than DRR in handling traffic under both normal and bursty traffic

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.

How this classification was reachedexpand

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: Methods · Consensus signal: none
Teacher disagreement score0.915
Threshold uncertainty score0.342

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.009
GPT teacher head0.202
Teacher spread0.193 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations3
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicNetwork Traffic and Congestion ControlFrench-language works237,207