Wireless Video Caching and Dynamic Streaming under Differentiated Quality Requirements

Minseok Choi, Joongheon Kim, Jaekyun Moon

Abstract

This paper considers one-hop device-to-device (D2D)-assisted wireless caching networks that cache video files of varying quality levels, with the assumption that the base station can control the video quality but cache-enabled devices cannot. Two problems arise in such a caching network: file placement problem and node association problem. This paper suggests a method to cache videos of different qualities, and thus of varying file sizes, by maximizing the sum of video quality measures that users can enjoy. There exists an interesting trade-off between video quality and video diversity, i.e., the ability to provision diverse video files. By caching high-quality files, the cache-enabled devices can provide high-quality video, but cannot cache a variety of files. Conversely, when the device caches various files, it cannot provide a good quality for file-requesting users. In addition, when multiple devices cache the same file but their qualities are different, advanced node association is required for file delivery. This paper proposes a node association algorithm that maximizes time-averaged video quality for multiple users under a playback delay constraint. In this algorithm, we also consider request collision, the situation where several users request files from the same device at the same time, and we propose two ways to cope with the collision: scheduling of one user and non-orthogonal multiple access. Simulation results verify that the proposed caching method and the node association algorithm work reliably.

Introduction

As mobile video consumption accounts for nearly 70% of global data traffic, traditional base station (BS) delivery is becoming a bottleneck. Caching popular content at the "edge"—specifically on user devices via Device-to-Device (D2D) communication—can significantly reduce latency and offload traffic from the core network.

System model of a D2D-assisted wireless caching network where users can fetch content from nearby devices or the base station.

However, most existing caching research treats files as monolithic blocks of fixed size. In reality, video streaming is dynamic; files exist in multiple quality levels (e.g., different bitrates or resolutions). This creates a fundamental Quality-Diversity Trade-off:

  1. High Quality: Caching high-bitrate files provides a better user experience but consumes more storage, limiting the variety of videos a device can hold.
  2. High Diversity: Caching many different low-quality files increases the "hit rate" (the chance a user finds what they want nearby) but results in a poorer visual experience.

Proposed Framework

The authors tackle two interlinked problems: File Placement (deciding which quality levels of which videos to store) and Node Association (deciding which neighbor a user should connect to, chunk-by-chunk, to maintain smooth playback).

Probabilistic Caching Policy

The file placement problem is modeled as a convex optimization task. Using Karush-Kuhn-Tucker (KKT) conditions and a bisection method, the authors derive closed-form caching probabilities for every video at every quality level. This ensures that the limited storage of a helper device is used to maximize the "successfully enjoyable video quality sum."

Visualization of the probabilistic file placement strategy, showing how different files and quality levels are distributed within a cache of size M=6.

Dynamic Node Association via Lyapunov Optimization

For the delivery phase, the authors treat the user’s playback buffer as a queue. They use a Lyapunov drift-plus-penalty framework to maximize video quality while ensuring "queue stability" (i.e., preventing the buffer from hitting zero and causing a stall). This allows the system to dynamically choose a lower-quality chunk if the channel is poor or the buffer is low, and switch to high quality when the buffer is "stacked."

Collision Resolution

When multiple users request files from the same device simultaneously, the paper evaluates two strategies:

  • Scheduling: Serving one user while the other seeks a different source or the BS.
  • NOMA (Non-Orthogonal Multiple Access): Serving both users simultaneously on the same frequency by managing interference.

Key Insights and Results

  • The "Buffer as a Queue" Intuition: By applying Lyapunov optimization to a video buffer, the authors create a controller that naturally prioritizes "safety" (no stalls) when the buffer is low and "luxury" (high quality) when the buffer is full.
  • The V-Parameter "Knob": A weight factor $V$ acts as a control knob. A high $V$ pushes the system toward maximum video quality, while a low $V$ prioritizes buffer health.
  • Performance: The proposed algorithm outperformed "Max-Arrival" (speed-focused) and "Highest-Quality" (risk-blind) baselines. It maintained a high average quality (approx. 38 dB PSNR) while keeping the "playback delay incidence" near zero.
  • NOMA vs. Scheduling: NOMA is not always superior. In some cases, the rate degradation from sharing a channel makes it better to schedule one user and force the other to find an alternative source.

Conclusion

This framework successfully balances the quality-diversity trade-off in D2D caching by combining optimized file placement with dynamic node association. Future work could address the energy constraints of helper devices and adapt to dynamic, time-varying content popularity.

Summary updated

Abstract

This paper considers one-hop device-to-device (D2D)-assisted wireless caching networks that cache video files of varying quality levels, with the assumption that the base station can control the video quality but cache-enabled devices cannot. Two problems arise in such a caching network: file placement problem and node association problem. This paper suggests a method to cache videos of different qualities, and thus of varying file sizes, by maximizing the sum of video quality measures that users can enjoy. There exists an interesting trade-off between video quality and video diversity, i.e., the ability to provision diverse video files. By caching high-quality files, the cache-enabled devices can provide high-quality video, but cannot cache a variety of files. Conversely, when the device caches various files, it cannot provide a good quality for file-requesting users. In addition, when multiple devices cache the same file but their qualities are different, advanced node association is required for file delivery. This paper proposes a node association algorithm that maximizes time-averaged video quality for multiple users under a playback delay constraint. In this algorithm, we also consider request collision, the situation where several users request files from the same device at the same time, and we propose two ways to cope with the collision: scheduling of one user and non-orthogonal multiple access. Simulation results verify that the proposed caching method and the node association algorithm work reliably.
BibTeX
@article{choi2018wireless,
  author = {Minseok Choi and Joongheon Kim and Jaekyun Moon},
  title = {{Wireless Video Caching and Dynamic Streaming under Differentiated Quality Requirements}},
  journal = {IEEE J. Sel. Areas Commun.},
  year = {2018},
  url = {https://openreview.net/forum?id=SsgnhT9DUa},
}
Figure