Cache aided wireless networks: Tradeoffs between storage and latency

Sengupta, Avik; Tandon, Ravi; Simeone, Osvaldo

doi:10.1109/ciss.2016.7460522

Cited by 85 publications

(129 citation statements)

References 17 publications

Supporting

Mentioning

128

Contrasting

Order By: Relevance

“…[1][2][3][4][5][6][7][8][9][10][11][12][13]). In particular, in a network with only one transmitter broadcasting to several receivers, it was shown in [2] that local delivery attains only a small fraction of the gain that caching can offer, and by designing a particular pattern in cache placement at the users and exploiting coding in delivery, a significantly larger global throughput gain can be achieved, which is a function of the entire cache throughout the network.…”

Section: Introductionmentioning

confidence: 99%

“…As a follow-up, this work has been extended to the case of multiple transmitters in [3], where it was shown that the gain of caching can be improved if several transmitters have access to the entire library of files. Caching at the transmitters was also considered in [4,5] and used to induce collaboration between transmitters in the network. It is also shown in [7] that caches at the transmitters can improve load balancing and increase the opportunities for interference alignment.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Fundamental Limits of Cache-Aided Interference Management

Naderializadeh

Maddah-Ali

Avestimehr

2017

IEEE Trans. Inform. Theory

201

314

View full text Add to dashboard Cite

We consider a system, comprising a library of N files (e.g., movies) and a wireless network with KT transmitters, each equipped with a local cache of size of MT files, and KR receivers, each equipped with a local cache of size of MR files. Each receiver will ask for one of the N files in the library, which needs to be delivered. The objective is to design the cache placement (without prior knowledge of receivers' future requests) and the communication scheme to maximize the throughput of the delivery. In this setting, we show that the sum degrees-of-freedom (sum-DoF) of min, KR is achievable, and this is within a factor of 2 of the optimum, under one-shot linear schemes. This result shows that (i) the one-shot sum-DoF scales linearly with the aggregate cache size in the network (i.e., the cumulative memory available at all nodes), (ii) the transmitters' caches and receivers' caches contribute equally in the one-shot sum-DoF, and (iii) caching can offer a throughput gain that scales linearly with the size of the network.To prove the result, we propose an achievable scheme that exploits the redundancy of the content at transmitters' caches to cooperatively zero-force some outgoing interference, and availability of the unintended content at the receivers' caches to cancel (subtract) some of the incoming interference. We develop a particular pattern for cache placement that maximizes the overall gains of cache-aided transmit and receive interference cancellations. For the converse, we present an integer optimization problem which minimizes the number of communication blocks needed to deliver any set of requested files to the receivers. We then provide a lower bound on the value of this optimization problem, hence leading to an upper bound on the linear one-shot sum-DoF of the network, which is within a factor of 2 of the achievable sum-DoF.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Fundamental Limits of Cache-Aided Interference Management

Naderializadeh

Maddah-Ali

Avestimehr

2017

IEEE Trans. Inform. Theory

201

314

View full text Add to dashboard Cite

show abstract

“…An alternative performance measure, called the normalized delivery time (NDT), is introduced in [15], in order to account for the latency in the system. The NDT is defined as the asymptotic delivery time per bit in the high-power, longblocklength regime, that is,…”

Section: System Modelmentioning

confidence: 99%

“…Authors show that, for this particular approach, ZF is not needed for order-optimal delivery. Finally, in [15], authors introduce the normalized delivery time (NDT) as a measure of performance for cacheaided networks. They characterize the NDT for 2 × 2 and 3 × 3 interference networks with caches only at the transmitter side.…”

Section: Introductionmentioning

confidence: 99%

Interference networks with caches at both ends

Roig

Gündüz

Tosato

2017

2017 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

Abstract-A KT × KR cache-aided wireless interference network, in which both the transmitters and the receivers are equipped with cache memories is studied. Each user requests one file from a library of N popular files. The goal is to design the cache contents without the knowledge of the particular user demands, such that all possible demand combinations can be satisfied reliably over the interference channel. The achievable sum degrees-of-freedom (sDoF) and the normalized delivery time (NDT) are studied for centralized and decentralized network architectures, respectively. First, using a combination of interference alignment (IA), zero-forcing (ZF) and interference cancellation (IC) techniques, a novel caching and transmission scheme for centralized networks is introduced, and it is shown to improve the sDoF upon the state-of-the-art. Then, the NDT is studied when the content placement at the receiver caches is carried out in a decentralized manner. Our results indicate that, for this particular network architecture, caches located at the receiver side are more effective than those at the transmitter side in order to reduce the NDT.

show abstract

“…Rate-memory tradeoff is investigated in device-to-device (D2D) networks [6] and secrecy constraint [5]. In [7], the authors study the tradeoff between the cache memory at edge nodes and the transmission latency. The ratememory tradeoff of multi-layer coded caching networks is studied in [8].…”

Section: Introductionmentioning

confidence: 99%

Energy-efficient design for edge-caching wireless networks: When is coded-caching beneficial?

Chatzinotas

Ottersten

2017

2017 IEEE 18th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

View full text Add to dashboard Cite

Abstract-Content caching is an efficient technique to reduce delivery latency and system congestion during peak-traffic times by bringing data closer to end users. Existing works consider caching only at higher layers separated from physical layer. In this paper, we study wireless caching networks by taking into account cache capability when designing the signal transmission. In particular, we investigate multi-layer caching and their performance in edge-caching wireless networks where both base station (BS) and users are capable of storing content data in their local cache. Two notable uncoded and coded caching strategies are studied. Firstly, we propose a coded caching strategy that is applied to arbitrary value of cache size. The required backhaul and access rates are given as a function of the BS and user cache size. Secondly, closed-form expressions for the system energy efficiency (EE) corresponding to the two caching methods are derived. Thirdly, the system EE is maximized via precoding vectors design and optimization while satisfying the user request rate. Finally, numerical results are presented to verify the effectiveness of the two caching methods.

show abstract

Cache aided wireless networks: Tradeoffs between storage and latency

Cited by 85 publications

References 17 publications

Fundamental Limits of Cache-Aided Interference Management

Fundamental Limits of Cache-Aided Interference Management

Interference networks with caches at both ends

Energy-efficient design for edge-caching wireless networks: When is coded-caching beneficial?

Contact Info

Product

Resources

About