MétaCan
Menu
Back to cohort
Record W2129871504 · doi:10.1109/infcom.1995.515950

Approximation formulae for blocking probabilities in a large Erlang loss system: a probabilistic approach

2002· article· en· W2129871504 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 institutionsInstitut National de la Recherche ScientifiqueMcGill University
Fundersnot available
KeywordsErlang (programming language)Probabilistic logicErlang distributionBlocking (statistics)Approximation theoryApplied mathematicsComputer scienceApproximation algorithmMathematical optimizationMathematicsAlgorithmTheoretical computer scienceMathematical analysisStatisticsArtificial intelligence

Abstract

fetched live from OpenAlex

In this paper, we use a probabilistic approach to present a unified view of classical blocking probabilities approximation formulae for a multi-rate Erlang loss system, both in the finite and infinite population cases. Combining our results with the uniform approximation due to Bleistein, we recover the results Mitra and Morrison which were obtained by saddlepoint techniques. We also show that we can avoid using the uniform approximation to get "specialized" formulae for the heavy, critical, generalized critical and light traffic cases. Numerical results for typical loss levels in the ATM case are presented where we compare the uniform approximation (UA) with the specialized approximations (SA).

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.001
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: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.944
Threshold uncertainty score0.742

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.001
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.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.022
GPT teacher head0.218
Teacher spread0.196 · 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