MétaCan
Menu
Back to cohort
Record W2112259255 · doi:10.1109/aina.2003.1192880

User-oriented fair buffer management for MPEG video streams

2003· article· en· W2112259255 on OpenAlexaff
M.R. Ito

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicVideo Coding and Compression Technologies
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsPacket lossComputer scienceComputer networkNetwork packetQuality of serviceVideo qualityNetwork congestionBuffer (optical fiber)Real-time computingTelecommunications

Abstract

fetched live from OpenAlex

Packet loss due to network congestion causes degradation in the quality of networked video transmitted over IP networks. Previous buffer management methods have been designed to prevent network congestion in order to reduce packet loss. However, a low packet loss ratio by itself does not necessarily translate to high video quality, so these methods do not ensure user-expected video quality; and hence, there is a need for alternative approaches to achieve user-expected video quality. This paper proposes a new buffer management scheme that focuses on achieving user-expected video quality, rather than just aiming at reducing packet loss. The proposed scheme allows the videos that share an output buffer to be guaranteed an appropriate share of the buffer when the buffer faces overflow, yet allows a complete sharing of the buffer space when it is not overflowing. The scheme also provides a mechanism that gives parts of a video lower loss than other parts. Simulation experiments show that the Quality of Service requirements of multiple videos and effective utilization of network resources can both be achieved.

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.002
metaresearch head score (Gemma)0.004
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.005
Threshold uncertainty score0.011

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.004
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.000
Science and technology studies0.0010.001
Scholarly communication0.0010.002
Open science0.0020.001
Research integrity0.0010.000
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.014
GPT teacher head0.245
Teacher spread0.231 · 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 designBench or experimental
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
Published2003
Admission routes1
Has abstractyes

Explore more

Same topicVideo Coding and Compression TechnologiesFrench-language works237,207