We study hotplug coded caching in combinatorial multi-access networks, which generalizes existing hotplug coded caching models by allowing users to access multiple caches, while only a subset of caches is online during the delivery phase. We first generalize the Hotplug Placement Delivery Array (HpPDA) framework to the combinatorial multi-access setting. Based on this generalized framework, we propose a t-design-based coded caching scheme for combinatorial multi-access networks. We characterize a class of design parameters under which every active user has access to a sufficient number of coded subfiles to decode its requested file, and show that appropriate parameter choices allow for the elimination of redundant multicast transmissions. As a result, the proposed scheme achieves a family of rate memory trade offs with flexible subpacketization. We present numerical comparisons illustrating that the proposed t-scheme outperforms existing hotplug coded caching schemes in certain memory regimes.

翻译：本文研究组合多接入网络中的热插拔编码缓存问题，该模型通过允许用户访问多个缓存，同时仅在传输阶段有部分缓存在线，推广了现有的热插拔编码缓存模型。我们首先将热插拔布局传输阵列框架推广至组合多接入场景。基于该推广框架，提出一种基于t设计的组合多接入网络编码缓存方案。我们刻画了一类设计参数，使得每个活跃用户都能访问足够数量的编码子文件以解码其请求文件，并证明通过适当的参数选择可以消除冗余组播传输。因此，所提方案实现了具有灵活子分组化特性的速率-内存权衡曲线族。数值比较结果表明，在特定内存区间内，所提t方案优于现有的热插拔编码缓存方案。