MétaCan
Menu
Back to cohort
Record W2896136758 · doi:10.1109/itc30.2018.10062

Network Calculus for Mean Delay Analysis Through a Network

2018· article· en· W2896136758 on OpenAlexaff
Fabrice Guillemin, Ravi R. Mazumdar, Catherine Rosenberg, Yu Ying

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldBusiness, Management and Accounting
TopicAdvanced Queuing Theory Analysis
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsBurstinessBounded functionPoisson distributionNetwork calculusUpper and lower boundsComputer scienceQueueQueueing theoryConstraint (computer-aided design)Topology (electrical circuits)Routing (electronic design automation)Mathematical optimizationMathematicsApplied mathematicsQuality of serviceComputer networkCombinatoricsNetwork packetMathematical analysisStatistics

Abstract

fetched live from OpenAlex

In this paper, a framework is developed to estimate the mean delay performance of (σ, ρ, π) regulated flows in networks with acyclic routing. We first show that the mean delay performance can be bounded by on-off type processes with exponentially distributed off periods. We then obtain per-flow bounds on the mean delay. We show that when there is no peak rate constraint, the Pollaczek-Khinchine formula for M/G/1 queues provides a tight bound thus establishing the Better-than-Poisson property for such flows. We then consider flows inside a network and show that they can be characterized by a stochastic burstiness parameter and show how the aggregate performance can be bounded from the asymptotic Better-than-Poisson property of regulated flows.

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.001
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: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.936
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.003
Science and technology studies0.0010.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.021
GPT teacher head0.264
Teacher spread0.243 · 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.

Study designTheoretical or conceptual
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

Citations2
Published2018
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Queuing Theory AnalysisFrench-language works237,207