Multi-library coded caching

Sahraei, Saeid; Gastpar, Michael

doi:10.1109/allerton.2016.7852345

Cited by 6 publications

(5 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Reception at the users is affected by the fronthaul quantization noise, as well as by the channel noise. If the quantization rate is properly chosen, it can be proved that the achievable NDT is (70), where the term K/ min{M, K} is the edge-NDT in (19), which is the same as for the ideal ZF scheme, and the term K/(r min{M, K}) is the fronthaul-NDT (18). A more detailed discussion is provided next.…”

Section: A Standard Soft-transfer Fronthaulingmentioning

confidence: 99%

Fog-Aided Wireless Networks for Content Delivery: Fundamental Latency Tradeoffs

Sengupta

Tandon

Simeone

2017

IEEE Trans. Inform. Theory

151

215

View full text Add to dashboard Cite

A fog-aided wireless network architecture is studied in which edge-nodes (ENs), such as base stations, are connected to a cloud processor via dedicated fronthaul links, while also being endowed with caches. Cloud processing enables the centralized implementation of cooperative transmission strategies at the ENs, albeit at the cost of an increased latency due to fronthaul transfer. In contrast, the proactive caching of popular content at the ENs allows for the low-latency delivery of the cached files, but with generally limited opportunities for cooperative transmission among the ENs. The interplay between cloud processing and edge caching is addressed from an information-theoretic viewpoint by investigating the fundamental limits of a high Signal-to-Noise-Ratio (SNR) metric, termed normalized delivery time (NDT), which captures the worst-case coding latency for delivering any requested content to the users. The NDT is defined under the assumptions of either serial or pipelined fronthauledge transmission, and is studied as a function of fronthaul and cache capacity constraints. Placement and delivery strategies across both fronthaul and wireless, or edge, segments are proposed with the aim of minimizing the NDT. Information-theoretic lower bounds on the NDT are also derived. Achievability arguments and lower bounds are leveraged to characterize the minimal NDT in a number of important special cases, including systems with no caching capabilities, as well as to prove that the proposed schemes achieve optimality within a constant multiplicative factor of 2 for all values of the problem parameters. Index TermsCaching, Cloud Radio Access Network (C-RAN), Fog Radio Access Network, edge processing, 5G, degreesof-freedom, latency, wireless networks, interference channel. the fronthaul capacity is small. This is because, with pipelined transmission, the ENs need not wait for the fronthaul transmission to be completed before communicating to the users on the edge links. For the same reason, pipelined fronthaul-edge transmission generally improves the NDT compared to serial transmission. In particular, even with partial caching, that is, with µ < 1, the ideal NDT δ * = 1 is achievable with pipelined fronthaul-edge transmission, while this is not the case with serial transmission. More details can be found in Sections V-C and VI-D.Related Work: The line of work pertaining to the information-theoretic analysis of cache-aided communication systems can be broadly classified into studies that consider caching at the end-users' devices or at the ENs. This research direction was initiated by [9], [10] for a set-up that consists of a multicast link with cache-aided receivers. This work demonstrates that coded multicasting enables global caching gains to be reaped, as opposed to the conventional local caching gains of uncoded transmission. Follow-up papers on related models with receiver-end caching include [11]-[24]. The present paper is instead inscribed in the parallel line of work that concerns caching at the ENs of a wireless n...

show abstract

Section: A Standard Soft-transfer Fronthaulingmentioning

confidence: 99%

Fog-Aided Wireless Networks for Content Delivery: Fundamental Latency Tradeoffs

Sengupta

Tandon

Simeone

2017

IEEE Trans. Inform. Theory

151

215

View full text Add to dashboard Cite

show abstract

“…This revolutionary idea has sprung a wealth of research efforts, such as device-to-device (D2D) networks [50], [51], non-uniform content popularities [52], online caching policies [53], multi-servers [54], multi-library [55], and combination with CSI [56]. From the implementation point of view, promising research directions include extensions to capture system aspects such as (i) popularity skew, (ii) asynchronous requests, (iii) finite code lengths and (iv) cache sizes that scale slower than M .…”

Section: B Coded Caching For Broadcast Medium Exploitationmentioning

confidence: 99%

Caching in large wireless networks

Paschos

Kountouris

2017

5G Wireless Technologies

View full text Add to dashboard Cite

“…In our setup, each receiver demands a file from only one of the two library. This differs from the setup in [8] (which does not impose secrecy constraints), where each receiver demands a file from each libraries. Like in the standard coded caching scenario, the transmitter ignores the receivers' demands during the placement phase.…”

Section: Introductionmentioning

confidence: 99%

Multi-library Coded Caching with Partial Secrecy

Sarkiss

Wigger

2019

2019 IEEE Information Theory Workshop (ITW)

View full text Add to dashboard Cite

The paper considers a coded caching setup with two libraries and where only one of them needs to be kept secret from an external eavesdropper. We provide upper and lower bounds on the secrecy rate-memory tradeoff for systems with K = 2 or K = 3 receivers. Our bounds are tight in some regimes and show that the standard (non-secure) coded caching upper bound can be approached for a wide range of parameters. In some cases, the proposed upper bound on the secrecy rate-memory tradeoff is even lower than the lower bound for standard coded caching. The reason is that in our setup the ratio of receivers requesting secure files over those requesting nonsecure files is fixed and known to everyone in advance. The transmitter can thus adjust the contents stored in the cache memories to this ratio.

show abstract

Multi-library coded caching

Cited by 6 publications

References 12 publications

Fog-Aided Wireless Networks for Content Delivery: Fundamental Latency Tradeoffs

Fog-Aided Wireless Networks for Content Delivery: Fundamental Latency Tradeoffs

Caching in large wireless networks

Multi-library Coded Caching with Partial Secrecy

Contact Info

Product

Resources

About