.png){kind=icon}
.png){kind=icon}
Return
On the Dynamic Centralized Coded Caching Design
.png){kind=icon}
OA
AI
DOI：10.1109/TCOMM.2020.2970941.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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, namely 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 all users in 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.
Keywords:
Servers
Manganese
Multicast communication
Encoding
Bipartite graph
Technological innovation
Prefetching
Concatenating-based placement
saturating matching-based delivery
dynamic coded caching scheme
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W
Organization
View more organizations