MétaCan
Menu
Back to cohort
Record W4392567309 · doi:10.1109/tvt.2024.3374303

Cost-Aware Task Offloading and Migration for Wireless Virtual Reality Using Interactive A3C Approach

2024· article· en· W4392567309 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

VenueIEEE Transactions on Vehicular Technology · 2024
Typearticle
Languageen
FieldEngineering
TopicRobotics and Automated Systems
Canadian institutionsUniversity of British ColumbiaCarleton University
FundersChina Postdoctoral Science FoundationNational Natural Science Foundation of China
KeywordsComputer scienceVirtual realityComputer networkWirelessTask (project management)Augmented realityHuman–computer interactionEngineeringTelecommunications

Abstract

fetched live from OpenAlex

Wireless virtual reality (VR) is becoming a promising service to provide users with immersive experience from anywhere. To deal with the performance-cost negotiation for a MEC-enabled wireless VR, we propose a cost-aware task offloading and migration scheme. We formulate the viewport rendering offloading, task migration, and subchannel allocation as an optimization problem, taking into account a long-term MEC operational cost budget and fluctuating channel conditions. To solve the problem, the Lyapunov optimization method is used to transform the long-term optimization to be a real-time optimization problem. Additionally, we design an interactive Asynchronous Advantage Actor-Critic (IA3C) algorithm to solve the problem in an online fashion. Our results show that the proposed scheme and the IA3C algorithm can substantially reduce the computing load of VR terminals while maintaining a low MEC operational cost in a high convergence rate.

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

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.025
GPT teacher head0.267
Teacher spread0.241 · 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