Coded Caching Design for Dynamic Networks with Reduced Subpacketizations

Coded caching is an effective technique to reduce the data transmission load by exploiting the cache contents across the network. However, most coded caching schemes are designed for static networks that consist of only a placement phase and a delivery phase among a constant number of users. In practice, a network maybe dynamic with multiple rounds of placement and delivery phases, and the number of users may vary. In such dynamic networks, a conventional coded caching scheme may lead to the undesired content updates at the users’ cache, which is caused by the newly joining users. This paper proposes a centralized coded caching scheme for dynamic networks that can support multiple rounds and accommodate the newly joining users during this process. It prevents cache contents of the existing users from being updated. It is shown that the proposed scheme can yield a reduced subpacketization level and achieve a good rate-memory tradeoff.