MétaCan
Menu
← Back to cohort
Record W2110674033 · doi:10.1109/lcn.2014.6925821

Optimal rate allocation and scheduling in cooperative streaming

2014· article· en· W2110674033 on OpenAlexaff
Mohammad Reza Zakerinasab, Mea Wang

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsComputer scienceComputer networkScheduling (production processes)Mobile deviceCellular networkSession (web analytics)WirelessReal-time computingDistributed computingTelecommunicationsEngineeringOperating system

Abstract

fetched live from OpenAlex

While the demand for multimedia streaming, especially from mobile devices, is growing rapidly, mobile devices are challenged by the variable transmission rate in wireless channels and limited battery capacity. In this paper, we propose an energy-efficient cooperative streaming system. In the proposed system, mobile devices collectively stream a copy of the multimedia content from the source over cellular links. The devices form a cooperative group and share received content, in coded form for efficient loss detection and recovery, with each other over short-range links. The sharing is guided by the optimal rate allocation and scheduling (RAS) algorithm that determines the amount of data and the data to be transmitted on each link. Overall, the system minimizes both the streaming traffic in the cellular network and the energy consumed by streaming applications on mobile devices. Our experimental results also show that the RAS algorithm prolongs the streaming session for the entire cooperative group.

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

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.005
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.000
Insufficient payload (model declined to judge)0.0010.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.273
Teacher spread0.247 · 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

Citations0
Published2014
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network Coding→French-language works237,207→