MétaCan
Menu
Back to cohort
Record W2097746153 · doi:10.1109/glocom.2009.5425897

Stochastic Rate Control for Scalable VBR Video Streaming over Wireless Networks

2009· article· en· W2097746153 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
FieldComputer Science
TopicVideo Coding and Compression Technologies
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsComputer scienceWireless networkReal-time computingVideo qualityWirelessComputer networkMarkov decision processGreedy algorithmChannel (broadcasting)ScalabilityMarkov processAlgorithm

Abstract

fetched live from OpenAlex

Video streaming over wireless links is a challenging problem due to both the unreliable, time-varying nature of the wireless channel and the stringent delivery requirements of media traffic. Layered encoded video can be used to improve the system performance by adapting the sending rate for different video frame layers to the varying network and playout situations. In this paper, we study the adaptive control of sending rates for both the base layer and enhancement layer based on feedback information from the wireless receiver. We formulate the problem in a framework of Markov decision processes to minimize a weighted sum of video quality and playout continuity degradation. In order to decrease the computation complexity, we then develop an online greedy algorithm, which only considers the current control time period. Simulation results show that the propose adaptive rate control provides significantly improved video quality and playout smoothness. Furthermore, when rate control is not performed very frequently, the greedy algorithm achieves a video distortion rate nearly matching that of the ideal optimal dynamic programming policy.

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 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.980
Threshold uncertainty score0.540

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.0010.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.012
GPT teacher head0.240
Teacher spread0.228 · 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