# On the Dynamic Centralized Coded Caching Design

## TL;DR

This paper proposes a dynamic centralized coded caching scheme that adapts to changing network conditions, reducing content updates and maintaining caching gains across multiple rounds, using bipartite graph analysis.

## Contribution

It introduces a novel dynamic coded caching design based on concatenating placement and saturating matching delivery, addressing multi-round network dynamics.

## Key findings

- Achieves flexible coded multicast in dynamic networks
- Reduces frequent cache content updates
- Proven to be order optimal

## Abstract

Coded caching scheme provides us an effective framework to realize additional coded multicasting gain by exploiting coding into multiple transmitted signals. The goal of coded caching design is to jointly optimize the placement and delivery scheme so as to minimize the amount of transmitted coded signals. However, few research efforts consider multiple-round coded caching design problem, in which fixed and mobile users may coexist in one network different number of active users present in successive rounds. Obviously, such dynamic network configurations may lead to undesired frequent placement caching content updating at user sides, if we assume coded caching scheme for each round separately. Thus how to tailor the coded caching design, such that the frequent caching content updating in the placement phase can be avoided, and simultaneously retaining full caching gain in delivery phase in multiple rounds will become highly desirable. In this paper, by carefully examining the bipartite graph representation of the coded caching scheme, a dynamic centralized coded caching design is proposed on the basis of the concatenating-based placement and the saturating matching based delivery scheme. Our analysis unveils that, the proposed dynamic coded caching scheme can realize the flexible coded multicast, and is order optimal.