The Exact Capacity-Memory Tradeoff for Caching with Uncoded Prefetching in the Two-Receiver Gaussian Broadcast Channel

Salman, Mohamed; Varanasi, Mahesh K.

doi:10.1109/isit.2019.8849343

Cited by 4 publications

(6 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This dependency on auxiliary power control variable(s) becomes more problematic in larger networks with arbitrary K, where the physical channel communicates multiple nested sets of multicast messages, giving rise to delay-rate characterizations which are difficult to analyse. Effects of this complexity are seen through previous results on coded caching in the degraded GBC, see, e.g., [10][11][12].…”

Section: Generalized Degrees Of Freedom Regimementioning

confidence: 87%

“…In the context of single-transmitter networks, the coded caching paradigm has been extended to noisy settings, including erasure and degraded BCs [8][9][10][11][12][13][14][15][16], and multi-antenna BCs [17][18][19][20][21][22][23][24][25]. For multi-transmitter settings, coded caching has been studied in device-to-device (D2D) networks [26], interference networks with caches at the transmitters only or at both transmitters and receivers [27][28][29][30][31][32][33], and fog radio access networks (F-RANs) [34,35], among other settings.…”

Section: Wireless Cachingmentioning

confidence: 99%

“…Another set of closely related results for the cache-aided degraded GBC, in the absence of non-content messages, are found in [10][11][12], where the exact delay measure (or its rate reciprocal) is considered instead of the GNDT approximation. In [10], the authors focus on minimizing the transmit power subject to a delay constraint-a dual to the more common problem of delay minimization subject to a transmit power constraint.…”

Section: Overview Of Contributions and Related Workmentioning

confidence: 99%

“…the inexplicit characterizations which are strongly coupled with auxiliary optimization variables, as well as the lack of information-theoretic optimality guarantees. Finally, in [12] the authors obtain a complete characterization of the optimal delay in the 2-user cache-aided GBC under the restriction of uncoded caching schemes. Nevertheless, it is not yet clear whether the techniques can be extended to more general setting, with an arbitrary number of users and (possibly) coded cache placement.…”

Section: Overview Of Contributions and Related Workmentioning

confidence: 99%

“…Finally, the inequality in (74) follows from the results in [5] (see also [6,Appendix G] where a similar step is used). 12…”

Section: Bounding the Right-hand-side Of (62)mentioning

confidence: 99%

See 4 more Smart Citations

Fundamental Limits of Wireless Caching Under Mixed Cacheable and Uncacheable Traffic

Joudeh¹,

Lampiris²,

Elia³

et al. 2020

Preprint

View full text Add to dashboard Cite

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.

show abstract

Section: Generalized Degrees Of Freedom Regimementioning

confidence: 87%

Section: Wireless Cachingmentioning

confidence: 99%

Section: Overview Of Contributions and Related Workmentioning

confidence: 99%

Section: Overview Of Contributions and Related Workmentioning

confidence: 99%

“…Finally, the inequality in (74) follows from the results in [5] (see also [6,Appendix G] where a similar step is used). 12…”

Section: Bounding the Right-hand-side Of (62)mentioning

confidence: 99%

See 3 more Smart Citations

Fundamental Limits of Wireless Caching Under Mixed Cacheable and Uncacheable Traffic

Joudeh¹,

Lampiris²,

Elia³

et al. 2020

Preprint

View full text Add to dashboard Cite

show abstract

Multi-antenna cache-aided channels

Lampiris

Elia

2021

Edge Caching for Mobile Networks

View full text Add to dashboard Cite

This work focuses on quality adaptation as a means to counter the effects of channel degradation in wireless, cacheaided channels. We design a delivery scheme which combines coded caching, superposition coding, and scalable source coding, while keeping the caching scheme oblivious to channel qualities. By properly adjusting the quality at the degraded users we are able to satisfy all demands in a time-efficient manner. In addition, superposition coding allows us to serve high-rate users with high content quality without subjecting them to a delay penalty caused by users with lower rate channels. We design a communication framework that covers all possible channel rate and quality configurations and we further provide algorithms that can optimise the served quality. An interesting outcome of this work is that a modest quality reduction at the degraded users can counter the effects of significant channel degradation. For example, in a 100-user system with normalized cache size 1/10 at each user, if 10 users experience channel degradation of 60% compared to the rate of the non-degraded users, we show that our transmission strategy leads to a ∼ 85% quality at the degraded users and perfect quality at the non-degraded users.

show abstract

An Upper Bound on the Capacity-Memory Tradeoff of Interleavable Discrete Memoryless Broadcast Channels with Uncoded Prefetching

Salman

Varanasi

2020

2020 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

The Exact Capacity-Memory Tradeoff for Caching with Uncoded Prefetching in the Two-Receiver Gaussian Broadcast Channel

Cited by 4 publications

References 6 publications

Fundamental Limits of Wireless Caching Under Mixed Cacheable and Uncacheable Traffic

Fundamental Limits of Wireless Caching Under Mixed Cacheable and Uncacheable Traffic

Multi-antenna cache-aided channels

An Upper Bound on the Capacity-Memory Tradeoff of Interleavable Discrete Memoryless Broadcast Channels with Uncoded Prefetching

Contact Info

Product

Resources

About