Coded caching with multiple file requests

Wei, Yi-Peng; Ulukuş, Şennur

doi:10.1109/allerton.2017.8262770

Cited by 24 publications

(31 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hence, the load is 2, which coincides with the converse bound under the constraint of MAN placement in [8], while the proposed caching scheme in [8] achieves 9/4.…”

Section: Appendix a Codes For Remarksupporting

confidence: 63%

“…Hence, the load is 5/3 which coincides with the converse bound under the constraint of MAN placement in [8], while the proposed caching scheme in [8] [8]). It can be seen that if we only focus on the demands of users 1, 2, 3, it is equivalent to our considered (N, K, M, r) = (3, 3, 1, 2) sharedlink caching problem with correlated files.…”

Section: Appendix a Codes For Remarksupporting

confidence: 61%

“…Third, after the construction of multicast messages destined for all groups, each user can cancel (or align) all non-intended 'symbols' (interferences) in all multicast messages which are useful to it. Different from existing round-division methods in [5]- [8], our scheme is designed to jointly serve the users' multi-demands. ] where t ∈ {0, 1, 2, K − 1, K}, respectively.…”

Section: Resultsmentioning

confidence: 99%

“…Remark 2. For the caching problem with multi-requests considered in [8] where each user demands L uncorrelated and equal-length files, the scheme in [8] was proved to be optimal under the constraint of the MAN placement for most demands with K ≤ 4 users, M = N/K, and L = 2, except one demand for K = 3 and three demands for K = 4. We can use the proposed scheme in this paper to achieve the optimality for those four unsolved cases.…”

Section: Resultsmentioning

confidence: 99%

“…For the caching problem with multi-requests [8], our proposed scheme is optimal under the constraint of MAN placement for the only four cases with L = 2, K ≤ 4, M = N/K, where the scheme in [8] is sub-optimal.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

On Coded Caching with Correlated Files

Wan

Tuninetti

et al. 2019

2019 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

This paper studies the fundamental limits of the shared-link caching problem with correlated files, where a server with a library of N files communicates with K users who can store M files. Given an integer r ∈ [N], correlation is modelled as follows: each r−subset of files contains a common block. The tradeoff between the cache size and the average transmitted load is considered. We first propose a converse bound under the constraint of uncoded cache placement (i.e., each user directly caches a subset of the library bits). We then propose an interference alignment scheme for the cases where users have different requests. The proposed scheme achieves the optimal average load under uncoded cache placement when users demand distinct files. In addition, an extension of the proposed scheme achieves an optimal average load among all possible demands (i.e., not necessarily distinct demands) for KrM ≤ 2N or KrM ≥ (K − 1)N or r ∈ {1, 2, N − 1, N}. As a by-product, we show that the proposed scheme reduces the load of existing schemes for the caching problem with multi-requests.T ⊆{du 1 ,...,du j }:|T |=2

show abstract

“…Hence, the load is 2, which coincides with the converse bound under the constraint of MAN placement in [8], while the proposed caching scheme in [8] achieves 9/4.…”

Section: Appendix a Codes For Remarksupporting

confidence: 63%

Section: Appendix a Codes For Remarksupporting

confidence: 61%

Section: Resultsmentioning

confidence: 99%

Section: Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

On Coded Caching with Correlated Files

Wan

Tuninetti

et al. 2019

2019 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

show abstract

Decentralized coded caching for shared caches using erasure coding

Dutta,

Thomas

2024

Physical Communication

View full text Add to dashboard Cite

Cache-Assisted Broadcast-Relay Wireless Networks: A Delivery-Time Cache-Memory Tradeoff

et al. 2019

View full text Add to dashboard Cite

An emerging trend of next generation communication systems is to provide network edges with additional capabilities such as storage resources in the form of caches to reduce file delivery latency.To investigate this aspect, we study the fundamental limits of a cache-aided broadcast-relay wireless network consisting of one central base station, M cache-equipped transceivers and K receivers from a latency-centric perspective. We use the normalized delivery time (NDT) to capture the per-bit latency for the worst-case file request pattern at high signal-to-noise ratios (SNR), normalized with respect to a reference interference-free system with unlimited transceiver cache capabilities. The objective is to design the schemes for cache placement and file delivery in order to minimize the NDT. To this end, we establish a novel converse (for arbitrary M and K) and two types of achievability schemes applicable to both time-variant and invariant channels. The first scheme is a general one-shot scheme for any M and K that synergistically exploits both multicasting (coded) caching and distributed zero-forcing opportunities. Apart from the obvious advantage of low signaling complexity, we show that the proposed one-shot scheme (i) attains gains attributed to both individual and collective transceiver caches (ii) is NDT-optimal for various parameter settings, particularly at higher cache sizes. The second scheme, on the other hand, designs beamformers to facilitate both subspace interference alignment and zero-forcing at lower cache sizes. Exploiting both schemes, we are able to characterize for various special cases of M and K which satisfy K + M ≤ 4 the optimal tradeoff between cache storage and latency. The tradeoff illustrates that the NDT is the preferred choice to capture the latency of a system rather than the commonly used sum degrees-of-freedom (DoF). In fact, our optimal tradeoff refutes the popular belief that increasing cache sizes translates to increasing the achievable sum DoF. As such, we identify and discuss cases where increasing cache sizes decreases both the delivery time and the achievable DoF. DRAFT 2 Index TermsCaching, interference alignment, degrees-of-freedom, latency, delivery time. DRAFT 4 with an arbitrary number of edge nodes and users. With these bounds, the optimality of schemes presented in [21] for certain regimes of cache sizes was shown under uncoded prefetching of the cached content. These concepts have been recently applied to Fog radio access networks (F-RAN) that consist of a centralized cloud server, cache-assisted edge nodes and mobile users.The NDT of F-RANs has been first fully characterized for two edge nodes and two mobile users [23]. Later on for the setting of arbitrary number of edge nodes and receivers a constant factor characterization of 2 has been established in [24]. The effect of channel strength and fading on the delivery time of partially connected F-RANs has been investigated in [25], [26], [27] on the basis of the binary fading model [28] and the linear deterministi...

show abstract

Coded caching with multiple file requests

Cited by 24 publications

References 11 publications

On Coded Caching with Correlated Files

On Coded Caching with Correlated Files

Decentralized coded caching for shared caches using erasure coding

Cache-Assisted Broadcast-Relay Wireless Networks: A Delivery-Time Cache-Memory Tradeoff

Contact Info

Product

Resources

About