We consider cache-aided wireless communication scenarios where each user requests both a file from an a-priori generated cacheable library (referred to as 'content'), and an uncacheable 'non-content' message generated at the start of the wireless transmission session. This scenario is easily found in real-world wireless networks, where the two types of traffic coexist and share limited radio resources. We focus on single-transmitter, single-antenna wireless networks with cache-aided receivers, where the wireless channel is modelled by a degraded Gaussian broadcast channel (GBC). For this setting, we study the delay-rate trade-off, which characterizes the content delivery time and non-content communication rates that can be achieved simultaneously. We propose a scheme based on the separation principle, which isolates the coded caching and multicasting problem from the physical layer transmission problem. We show that this separation-based scheme is sufficient for achieving an information-theoretically order optimal performance, up to a multiplicative factor of 2.01 for the content delivery time, when working in the generalized degrees of freedom (GDoF) limit. We further show that the achievable performance is near-optimal after relaxing the GDoF limit, up to an additional additive factor of 2 bits per dimension for the non-content rates. A key insight emerging from our scheme is that in some scenarios considerable amounts of non-content traffic can be communicated while maintaining the minimum content delivery time, achieved in the absence of non-content messages; compliments of 'topological holes' arising from asymmetries in wireless channel gains.
翻译:我们考虑的是缓存辅助无线通信方案,即每个用户既要求来自优先生成的缓存库(称为“内容”)的文件(称为“内容”),又要求在无线传输会话开始时生成的不可缓存的“非内容”信息。这个方案很容易在现实世界无线网络中找到,其中两种类型的交通同时并存,并分享有限的无线电资源。我们关注的是单传输、单端无线网络和缓存辅助接收器。我们关注的是单一传输、单端无线网络,其中无线频道由一个退化的高斯广播频道(GBC)模拟。对于这个设置,我们研究的是延迟率交易,这是内容交付时间和不可缓存的最低时间和可同时实现的非内容。我们提出一个基于分离原则的方案,它把编码的缓存和多端问题与物理层传输问题隔开来分开。我们表明,这种基于分离的系统足以实现信息-表面秩序的最佳性能,达到2.01的倍复制性信息传输时间,在非普遍自由度(GDoF)的交付时间段交付时间和不可延迟的节流交付时间范围后,我们又可以进一步显示一个可实现的硬度。