On the Fundamental Limits of Fog-RAN Cache-Aided Networks With Downlink and Sidelink Communications

Maddah-Ali and Niesen (MAN) in 2014 showed that coded caching in single bottleneck-link broadcast networks allows serving an arbitrarily large number of cache-equipped users with a total link load (bits per unit time) that does not scale with the number of users. Since then, the general topic of coded caching has generated enormous interest both from the information theoretic and (network) coding theoretic viewpoint, and from the viewpoint of applications. Building on the MAN work, this paper considers a particular network topology referred to as cache-aided Fog Radio Access Network (Fog-RAN), that includes a Macro-cell Base Station (MBS) co-located with the content server, several cache-equipped Small-cell Base Stations (SBSs), and many users without caches. Some users are served directly by the MBS broadcast downlink, while other users are served by the SBSs. The SBSs can also exchange data via rounds of direct communication via a side channel, referred to as "sidelink". For this novel Fog-RAN model, the fundamental tradeoff among (a) the amount of cache memory at the SBSs, (b) the load on the downlink (from MBS to directly served users and SBSs), and (c) the aggregate load on the sidelink is studied, under the standard worst-case demand scenario. Several existing results are recovered as special cases of this network model and byproduct results of independent interest are given. Finally, the role of topology-aware versus topology-agnostic caching is discussed.

[1]  A. Salman Avestimehr,et al.  The Exact Rate-Memory Tradeoff for Caching With Uncoded Prefetching , 2016, IEEE Transactions on Information Theory.

[2]  Yangyang Zhang,et al.  Coding, Multicast, and Cooperation for Cache- Enabled Heterogeneous Small Cell Networks , 2017, IEEE Transactions on Wireless Communications.

[3]  Deniz Gündüz,et al.  Coded Caching with Heterogeneous Cache Sizes and Link Qualities: The Two-User Case , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[4]  Ravi Tandon,et al.  Improved Approximation of Storage-Rate Tradeoff for Caching With Multiple Demands , 2016, IEEE Transactions on Communications.

[5]  Osvaldo Simeone,et al.  Harnessing cloud and edge synergies: toward an information theory of fog radio access networks , 2016, IEEE Communications Magazine.

[6]  Deniz Gündüz,et al.  Fundamental Limits of Coded Caching: Improved Delivery Rate-Cache Capacity Tradeoff , 2017, IEEE Transactions on Communications.

[7]  Mohammad Ali Maddah-Ali,et al.  The exact rate-memory tradeoff for caching with uncoded prefetching , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[8]  Urs Niesen,et al.  Cache-aided interference channels , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[9]  Osvaldo Simeone,et al.  Cloud-aided wireless networks with edge caching: Fundamental latency trade-offs in fog Radio Access Networks , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[10]  Daniela Tuninetti,et al.  On the optimality of uncoded cache placement , 2015, 2016 IEEE Information Theory Workshop (ITW).

[11]  Petros Elia,et al.  Full Coded Caching Gains for Cache-less Users , 2018, 2018 IEEE Information Theory Workshop (ITW).

[12]  Jeffrey G. Andrews,et al.  A Primer on Cellular Network Analysis Using Stochastic Geometry , 2016, ArXiv.

[13]  Jesús Gómez-Vilardebó,et al.  Fundamental Limits of Caching: Improved Rate-Memory Tradeoff with Coded Prefetching , 2018, 2018 IEEE International Conference on Communications (ICC).

[14]  Wei Yu,et al.  Optimization of Heterogeneous Coded Caching , 2017, IEEE Transactions on Information Theory.

[15]  Aylin Yener,et al.  Centralized Coded Caching with Heterogeneous Cache Sizes , 2017, 2017 IEEE Wireless Communications and Networking Conference (WCNC).

[16]  Konstantinos Poularakis,et al.  Exploiting Caching and Multicast for 5G Wireless Networks , 2016, IEEE Transactions on Wireless Communications.

[17]  Lawrence Ong,et al.  Centralized Caching with Unequal Cache Sizes , 2018, 2018 IEEE Information Theory Workshop (ITW).

[18]  Xiang Zhang,et al.  A New Design Framework on Device-to-Device Coded Caching with Optimal Rate and Significantly Less Subpacketizations , 2019, ArXiv.

[19]  Mohammad Ali Maddah-Ali,et al.  Fundamental limits of cache-aided interference management , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[20]  Aylin Yener,et al.  Benefits of cache assignment on degraded broadcast channels , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[21]  Osvaldo Simeone,et al.  Fundamental Limits of Cloud and Cache-Aided Interference Management With Multi-Antenna Edge Nodes , 2019, IEEE Transactions on Information Theory.

[22]  Jaime Llorca,et al.  Speeding Up Future Video Distribution via Channel-Aware Caching-Aided Coded Multicast , 2016, IEEE Journal on Selected Areas in Communications.

[23]  Jesús Gómez-Vilardebó,et al.  Fundamental Limits of Caching: Improved Rate-Memory Tradeoff With Coded Prefetching , 2018, IEEE Transactions on Communications.

[24]  Deniz Gündüz,et al.  Centralized Coded Caching of Correlated Contents , 2018, 2018 IEEE International Conference on Communications (ICC).

[25]  Nujoom Sageer Karat,et al.  An Optimal Linear Error Correcting Delivery Scheme for Coded Caching with Shared Caches , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

[26]  Mohammad Ali Maddah-Ali,et al.  Characterizing the rate-memory tradeoff in cache networks within a factor of 2 , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[27]  Xiaodong Wang,et al.  Efficient File Delivery for Coded Prefetching in Shared Cache Networks With Multiple Requests Per User , 2018, IEEE Transactions on Communications.

[28]  Petros Elia,et al.  Coded Caching with Shared Caches: Fundamental Limits with Uncoded Prefetching , 2018, ArXiv.

[29]  Michèle Wigger,et al.  Noisy Broadcast Networks With Receiver Caching , 2016, IEEE Transactions on Information Theory.

[30]  Zhi Chen.  Fundamental Limits of Caching: Improved Bounds For Small Buffer Users , 2014, ArXiv.

[31]  Jaime Llorca,et al.  Finite-Length Analysis of Caching-Aided Coded Multicasting , 2014, IEEE Transactions on Information Theory.

[32]  Mehdi Bennis,et al.  Living on the edge: The role of proactive caching in 5G wireless networks , 2014, IEEE Communications Magazine.

[33]  Osvaldo Simeone,et al.  Fundamental Limits of Cloud and Cache-Aided Interference Management with Multi-Antenna Base Stations , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[34]  Meixia Tao,et al.  Fundamental Tradeoff Between Storage and Latency in Cache-Aided Wireless Interference Networks , 2016, IEEE Transactions on Information Theory.

[35]  Osvaldo Simeone,et al.  How Much Can D2D Communication Reduce Content Delivery Latency in Fog Networks With Edge Caching? , 2019, IEEE Transactions on Communications.

[36]  Urs Niesen,et al.  Fundamental limits of caching , 2012, 2013 IEEE International Symposium on Information Theory.

[37]  Aylin Yener,et al.  Benefits of Coded Placement for Networks with Heterogeneous Cache Sizes , 2018, 2018 52nd Asilomar Conference on Signals, Systems, and Computers.

[38]  Sinong Wang,et al.  Coded Caching with Heterogenous Cache Sizes , 2015 .

[39]  Sennur Ulukus,et al.  Coded caching with multiple file requests , 2017, 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[40]  Daniela Tuninetti,et al.  On caching with more users than files , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[41]  Giuseppe Caire,et al.  Fundamental Limits of Caching in Wireless D2D Networks , 2014, IEEE Transactions on Information Theory.

[42]  Giuseppe Caire,et al.  Novel Inter-file Coded Placement and D2D Delivery for a Cache-aided Fog-RAN Architecture , 2018, ArXiv.

[43]  Aylin Yener,et al.  Device-to-Device Coded-Caching With Distinct Cache Sizes , 2019, IEEE Transactions on Communications.

[44]  Osvaldo Simeone,et al.  Fog-Aided Wireless Networks for Content Delivery: Fundamental Latency Tradeoffs , 2016, IEEE Transactions on Information Theory.

[45]  Giuseppe Caire,et al.  On the Optimality of D2D Coded Caching With Uncoded Cache Placement and One-Shot Delivery , 2019, IEEE Transactions on Communications.

[46]  Suhas N. Diggavi,et al.  Degrees of Freedom of Cache-Aided Wireless Interference Networks , 2016, IEEE Transactions on Information Theory.

[47]  Daniela Tuninetti,et al.  An Index Coding Approach to Caching With Uncoded Cache Placement , 2020, IEEE Transactions on Information Theory.

[48]  Mingyue Ji,et al.  A New Design Framework on D2D Coded Caching with Optimal Rate and Less Subpacketizations , 2020, 2020 IEEE International Symposium on Information Theory (ISIT).