MétaCan
Menu
Back to cohort
Record W1999423211 · doi:10.1109/iwcmc.2012.6314312

On-demand scheduling for concurrent multipath transfer under delay-based disparity

2012· article· en· W1999423211 on OpenAlexafffund
T. Daniel Wallace, Abdallah Shami

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicNetwork Traffic and Congestion Control
Canadian institutionsWestern University
FundersUniversity of TorontoPrinceton University
KeywordsComputer scienceScheduling (production processes)Distributed computingMultipath propagationNetwork congestionComputer networkFair-share schedulingData transmissionDynamic priority schedulingRound-robin schedulingJob shop schedulingReal-time computingMathematical optimization

Abstract

fetched live from OpenAlex

This paper proposes a new scheduling algorithm for concurrent multipath transfer (CMT) called the on-demand scheduler (ODS). Unlike previous algorithms, ODS waits for a transmission opportunity before making a scheduling decision. We showed ODS can outperform previous scheduling algorithms for CMT under various network scenarios. Moreover, this paper offers new insight into the effects of congestion and flow control on the receive buffer blocking problem associated with CMT.

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

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.028
GPT teacher head0.267
Teacher spread0.239 · 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
GenreEmpirical

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

Citations10
Published2012
Admission routes2
Has abstractyes

Explore more

Same topicNetwork Traffic and Congestion ControlFrench-language works237,207