MétaCan
Menu
Back to cohort
Record W1606932269 · doi:10.1109/icdt.2006.59

Performance Analysis of Weighted Fair Queues with Variable Service Rates

2006· article· en· W1606932269 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
FieldBusiness, Management and Accounting
TopicAdvanced Queuing Theory Analysis
Canadian institutionsMcGill UniversityUniversité du Québec
Fundersnot available
KeywordsQueueFork–join queueComputer scienceMultilevel queueBulk queueQueue management systemQueueing theoryDecoupling (probability)Computer networkEngineering

Abstract

fetched live from OpenAlex

This paper provides an analytical technique to estimate the queue length and delay distributions for Weighted Fair Queues (WFQ) with more than two queues and timecorrelated variable service rates, based on twodimensional decoupling. At first, temporal decomposition is used to convert the time-correlated queuing problem into a set of sub-problems over several time scales. Subsequently, queue decomposition exploits the queue weight dependencies to convert a multi-queue problem into a set of single-queue problems. The core of the analysis lies in estimating the multi-scale service rate models for each of these queues. The paper shows the hierarchy of this estimation and the dependency of the queue service rate on the other queues unused capacity and their weights. Simulation and analytical results on queue and delay survivor functions are in a good agreement.

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 categoriesInsufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.467
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.005
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.0010.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.005
GPT teacher head0.197
Teacher spread0.191 · 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

Citations8
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Queuing Theory AnalysisFrench-language works237,207