MétaCan
Menu
Back to cohort
Record W2106582082 · doi:10.1109/icccn.1995.540173

Traffic smoothing and bandwidth allocation for VBR MPEG-2 video connections in ATM network

2002· article· en· W2106582082 on OpenAlexaff
Jian Ni, Tao Yang

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicNetwork Traffic and Congestion Control
Canadian institutionsTechnical University of Nova Scotia
Fundersnot available
KeywordsDynamic bandwidth allocationVariable bitrateComputer scienceBandwidth allocationBandwidth (computing)SmoothingGaussianFrame (networking)MacroComputer networkReal-time computingAlgorithmBit rate

Abstract

fetched live from OpenAlex

We studied the traffic smoothing and bandwidth allocation issues for VBR MPEG-2 video connections in an ATM network. First of all, the statistical characteristics of VBR MPEG-2 video sequences were examined by real observation. The obtained results showed that it would be very difficult to efficiently allocate an appropriate amount of bandwidth if such traffic were straightforwardly feed into the network. We therefore introduced a so called macro-frame (M-frame) smoothing scheme. It was found that the smoothed traffic not only possesses relatively simple characteristics but also makes the bandwidth allocation more efficient. In consideration of the fact that there is not yet a proper bandwidth allocation algorithm for VBR MPEG-2 connections, we examined and compared the simple peak rate allocation and Gaussian approximation. It was found that (1) peak rate allocation is far more inefficient than the actual need and (2) Gaussian approximation is surprisingly accurate and efficient in estimating the bandwidth, especially in the case of smoothed traffic.

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.000
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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.956
Threshold uncertainty score0.426

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.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.017
GPT teacher head0.214
Teacher spread0.197 · 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.

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

Citations5
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicNetwork Traffic and Congestion ControlFrench-language works237,207