MétaCan
Menu
Back to cohort
Record W2564669092 · doi:10.1109/infcom.1994.337669

Capacity allocation in statistical multiplexing of ATM sources

2002· article· en· W2564669092 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 institutionsUniversity of Waterloo
Fundersnot available
KeywordsMultiplexerMultiplexingLinear approximationNonlinear systemApproximation algorithmMathematical optimizationComputer scienceSimple (philosophy)Applied mathematicsUpper and lower boundsMathematicsTelecommunicationsMathematical analysisPhysics

Abstract

fetched live from OpenAlex

The authors are concerned with the allocation of the available capacity of a statistical multiplexer to serve a number of heterogeneous on-off sources, with the cell loss rate as the performance criterion. In order to avoid using potentially lengthy simulations, they have derived computationally efficient bounds and asymptotic approximations for the cell loss rate. The union of all partitions of the available capacity which satisfies the capacity bound and the performance criterion is defined as the capacity region. Both linear approximation and nonlinear approximation of the capacity region are investigated. It is shown that the linear approximation is reasonably accurate when the activity factors of the sources are not too high (less than 0.8). For the case where the linear approximation appears too optimistic, a simple nonlinear approximation for determining the capacity region is suggested. The accuracy of the method is demonstrated using numerical examples.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

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: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.895
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.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.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.032
GPT teacher head0.234
Teacher spread0.201 · 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

Citations7
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Queuing Theory AnalysisFrench-language works237,207