MétaCan
Menu
Back to cohort
Record W2111555887 · doi:10.1109/iccs.1994.474199

On traffic shaping in ATM networks

2002· article· en· W2111555887 on OpenAlexaff
Robert C. Lehr, J.W. Mark

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldBusiness, Management and Accounting
TopicAdvanced Queuing Theory Analysis
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsComputer scienceComputer networkAsynchronous Transfer Mode

Abstract

fetched live from OpenAlex

This paper presents a simple, but effective traffic shaping mechanism which can greatly reduce the burstiness of a traffic source. Burstiness is defined here as the variance of the inter-cell-spaces or the interarrival times of a source. The shaping is performed based on the source characteristics, which are assumed to be known a priori. It is shown that various traffic sources can be shaped into a nearly deterministic on-off source. The shaped sources are then passed through a multiplexer, and its buffer occupancy is compared to the case of unshaped sources. 1 Introduction In an ATM setting, due to the fact that the transmission speed of the backbone network is orders of magnitude larger than that of the individual sources, multiplexing at the network access point to enhance network utilization is indispensable. In other words, the network provider wishes to achieve as high a multiplexing gain as possible in order to maintain a high level of link utilization. However, this implies th...

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation 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.002
Threshold uncertainty score0.007

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0010.002
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.026
GPT teacher head0.221
Teacher spread0.194 · 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 source (direct Gemma or distilled Codex), 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

Citations4
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Queuing Theory AnalysisFrench-language works237,207