869 research outputs found
Benefits of Cache Assignment on Degraded Broadcast Channels
International audienceDegraded K-user broadcast channels (BCs) are studied when the receivers are facilitated with cache memories. Lower and upper bounds are derived on the capacity-memory tradeoff, i.e., on the largest rate of reliable communication over the BC as a function of the receivers' cache sizes, and the bounds are shown to match for interesting special cases. The lower bounds are achieved by two new coding schemes that benefit from nonuniform cache assignments. Lower and upper bounds are also established on the global capacity-memory tradeoff, i.e., on the largest capacity-memory tradeoff that can be attained by optimizing the receivers' cache sizes subject to a total cache memory budget. The bounds coincide when the total cache memory budget is sufficiently small or sufficiently large, where the thresholds depend on the BC statistics. For small cache memories, it is optimal to assign all the cache memory to the weakest receiver. In this regime, the global capacity-memory tradeoff grows by the total cache memory budget divided by the number of files in the system. In other words, a perfect global caching gain is achievable in this regime and the performance corresponds to a system where all the cache contents in the network are available to all receivers. For large cache memories, it is optimal to assign a positive cache memory to every receiver, such that the weaker receivers are assigned larger cache memories compared to the stronger receivers. In this regime, the growth rate of the global capacity-memory tradeoff is further divided by the number of users, which corresponds to a local caching gain. It is observed numerically that a uniform assignment of the total cache memory is suboptimal in all regimes, unless the BC is completely symmetric. For erasure BCs, this claim is proved analytically in the regime of small cache sizes
Fundamental Limits of Wireless Caching Under Mixed Cacheable and Uncacheable Traffic
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.Comment: Accepted for publication in the IEEE Transactions on Information
Theor
Rate-Splitting for Max-Min Fair Multigroup Multicast Beamforming in Overloaded Systems
In this paper, we consider the problem of achieving max-min fairness amongst
multiple co-channel multicast groups through transmit beamforming. We
explicitly focus on overloaded scenarios in which the number of transmitting
antennas is insufficient to neutralize all inter-group interference. Such
scenarios are becoming increasingly relevant in the light of growing
low-latency content delivery demands, and also commonly appear in multibeam
satellite systems. We derive performance limits of classical beamforming
strategies using DoF analysis unveiling their limitations; for example, rates
saturate in overloaded scenarios due to inter-group interference. To tackle
interference, we propose a strategy based on degraded beamforming and
successive interference cancellation. While the degraded strategy resolves the
rate-saturation issue, this comes at a price of sacrificing all spatial
multiplexing gains. This motivates the development of a unifying strategy that
combines the benefits of the two previous strategies. We propose a beamforming
strategy based on rate-splitting (RS) which divides the messages intended to
each group into a degraded part and a designated part, and transmits a
superposition of both degraded and designated beamformed streams. The
superiority of the proposed strategy is demonstrated through DoF analysis.
Finally, we solve the RS beamforming design problem and demonstrate significant
performance gains through simulations
- …