Customized Transmission Protocol for Tile-Based 360° VR Video Streaming Over Core Network Slices
Bibliographic record
Abstract
Tile-based streaming has been proposed to address the challenge of high transmission rate demand in 360° virtual reality (VR) video streaming. However, it suffers from network and viewing behavior dynamics (i.e., head movements), while encoded video tiles have various properties in terms of transmission priority, deadline, and reliability requirement. Hence, a supporting transmission protocol is imperative. In this paper, we propose a customized transmission protocol based on Quick UDP Internet Connections (QUIC) which operates over a VR video network slice in the core network. The QUIC protocol is tailored to accommodate the characteristics of tile-based VR video streaming where explicit mapping relations between requested video tiles and QUIC streams are established. Two customized in-network protocol functionalities including packet filtering and caching-based packet retransmission are proposed, to filter out outdated video data due to field-of-view (FoV) prediction errors under viewing behavior dynamics and to achieve efficient packet retransmissions with disparate transmission reliability requirements. A slice-level packet header is designed to support enhanced slice-based VR video transmission with the proposed protocol functionalities. Key transport parameters are determined via theoretical analysis. Simulation results are presented to demonstrate the effectiveness of our proposed transmission protocol in achieving short average video segment downloading time and high average video segment quality.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".