Coded caching (CC) can substantially enhance network performance by leveraging memory as an additional communication resource. However, the use of CC is challenging in various practical applications due to dynamic user behavior. The existing solutions, based on shared caching, cannot directly handle all scenarios where users freely enter and depart the network at any time as they are constrained by specific conditions on network parameters. This paper proposes a universally applicable shared-caching scheme for dynamic setups without any restriction on network parameters. The closed-form expressions for the achievable degrees of freedom (DoF) are computed for the resulting generalized scheme, and are shown to achieve the existing optimal bounds of the shared-cache model. Furthermore, a successive-interference-cancellation-free extension based on a fast iterative optimized beamformer design is devised to optimize the use of excess spatial dimensions freed by cache-aided interference cancellation. Extensive numerical experiments are carried out to assess the performance of the proposed scheme. In particular, the results demonstrate that while a dynamic setup may achieve a DoF substantially lower than the optimal DoF of shared caching, our proposed scheme significantly improves the performance at the finite signal-to-noise ratio compared to unicasting, which only benefits from the local caching gain.

翻译：编码缓存(CC)通过利用内存作为额外的通信资源，能够显著提升网络性能。然而，由于用户行为的动态性，CC在实际应用中面临诸多挑战。现有基于共享缓存的解决方案因受网络参数特定条件约束，无法直接处理用户随时自由进出网络的所有场景。本文针对动态网络环境提出了一种普适性共享缓存方案，无需对网络参数施加任何限制。计算了该广义方案可实现自由度的闭合表达式，并证明其能达到共享缓存模型的最优界。此外，本文设计了一种基于快速迭代优化波束成形器的免连续干扰消除扩展方案，以优化缓存辅助干扰消除释放的额外空间维度的利用。通过大量数值实验评估所提方案的性能。结果表明：动态网络环境可能实现远低于共享缓存最优自由度的自由度值，但相较于仅受益于本地缓存增益的单播传输，所提方案在有限信噪比条件下显著提升了系统性能。