# Coded Caching for Delay-Sensitive Content

arXiv: https://arxiv.org/abs/1407.4489 · HTML: https://mlsanity.com/paper/1407.4489/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 16 Jul 2014.

## Built on by (most cited first, 1 of 1)

- [Learning Selective Merge Policies for Deadline-Constrained Coded Caching via Deep Reinforcement Learning](https://mlsanity.com/paper/2605.15236/) (2026)

## Abstract (arXiv)

Coded caching is a recently proposed technique that achieves significant performance gains for cache networks compared to uncoded caching schemes. However, this substantial coding gain is attained at the cost of large delivery delay, which is not tolerable in delay-sensitive applications such as video streaming. In this paper, we identify and investigate the tradeoff between the performance gain of coded caching and the delivery delay. We propose a computationally efficient caching algorithm that provides the gains of coding and respects delay constraints. The proposed algorithm achieves the optimum performance for large delay, but still offers major gains for small delay. These gains are demonstrated in a practical setting with a video-streaming prototype.