Improved Approximation of Storage-Rate Tradeoff for Caching With Multiple Demands

Caching at the network edge has emerged as a viable solution for alleviating the severe capacity crunch in modern content centric wireless networks by leveraging network load-balancing in the form of localized content storage and delivery. In this paper, we consider a cache-aided network, where the cache storage phase is assisted by a central server and users can demand multiple files at each transmission interval. To service these demands, we consider two delivery models: 1) centralized content delivery, where user demands at each transmission interval are serviced by the central server via multicast transmissions; and 2) device-to-device assisted distributed delivery, where users multicast to each other in order to service file demands. For such cache-aided networks, we present new results on the fundamental cache storage versus transmission rate tradeoff. Specifically, we develop a new technique for characterizing information theoretic lower bounds on the storage-rate tradeoff and show that the new lower bounds are strictly tighter than cut-set bounds from literature. Furthermore, using the new lower bounds, we improve the constant factor approximation of the optimal storage-rate tradeoff for cache-aided systems under both delivery models.

[1]  T. Charles Clancy,et al.  Decentralized caching with secure delivery , 2014, 2014 IEEE International Symposium on Information Theory.

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

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

[4]  Suhas N. Diggavi,et al.  Multi-level coded caching , 2014, 2014 IEEE International Symposium on Information Theory.

[5]  Vinod M. Prabhakaran,et al.  Critical database size for effective caching , 2015, 2015 Twenty First National Conference on Communications (NCC).

[6]  T. Charles Clancy,et al.  Secure caching with non-uniform demands , 2014, 2014 4th International Conference on Wireless Communications, Vehicular Technology, Information Theory and Aerospace & Electronic Systems (VITAE).

[7]  T. Charles Clancy,et al.  Fundamental Limits of Caching With Secure Delivery , 2013, IEEE Transactions on Information Forensics and Security.

[8]  Mohammad Mohammadi Amiri,et al.  Fundamental Limits of Coded Caching: Improved Delivery Rate-Cache Capacity Trade-off , 2016 .

[9]  Urs Niesen,et al.  Decentralized coded caching attains order-optimal memory-rate tradeoff , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[10]  Jaime Llorca,et al.  Order-Optimal Rate of Caching and Coded Multicasting With Random Demands , 2015, IEEE Transactions on Information Theory.

[11]  R. Michael Buehrer,et al.  Learning distributed caching strategies in small cell networks , 2014, 2014 11th International Symposium on Wireless Communications Systems (ISWCS).

[12]  Osvaldo Simeone,et al.  Cloud RAN and edge caching: Fundamental performance trade-offs , 2016, 2016 IEEE 17th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC).

[13]  Seyed Pooya Shariatpanahi,et al.  Multi-Server Coded Caching , 2015, IEEE Transactions on Information Theory.

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

[15]  Jaime Llorca,et al.  Caching-aided coded multicasting with multiple random requests , 2015, 2015 IEEE Information Theory Workshop (ITW).

[16]  Suhas N. Diggavi,et al.  Content caching and delivery over heterogeneous wireless networks , 2014, 2015 IEEE Conference on Computer Communications (INFOCOM).

[17]  Giuseppe Caire,et al.  Optimal throughput-outage trade-off in wireless one-hop caching networks , 2013, 2013 IEEE International Symposium on Information Theory.

[18]  Xinbing Wang,et al.  Coded caching under arbitrary popularity distributions , 2015, 2015 Information Theory and Applications Workshop (ITA).

[19]  Osvaldo Simeone,et al.  Pipelined Fronthaul-Edge Content Delivery in Fog Radio Access Networks , 2016, 2016 IEEE Globecom Workshops (GC Wkshps).

[20]  Hooshang Ghasemi,et al.  Improved lower bounds for coded caching , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

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

[22]  Osvaldo Simeone,et al.  Cache aided wireless networks: Tradeoffs between storage and latency , 2015, 2016 Annual Conference on Information Science and Systems (CISS).

[23]  Michael Gastpar,et al.  A new converse bound for coded caching , 2016, 2016 Information Theory and Applications Workshop (ITA).

[24]  Chao Tian.  A Note on the Fundamental Limits of Coded Caching , 2015, ArXiv.

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

[26]  Suhas N. Diggavi,et al.  Coded Caching for Heterogeneous Wireless Networks with Multi-level Access , 2014, ArXiv.

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

[28]  Mohammad Ali Maddah-Ali,et al.  Fundamental Limits of Cache-Aided Interference Management , 2017, IEEE Trans. Inf. Theory.

[29]  Leandros Tassiulas,et al.  Asymptotic Laws for Joint Content Replication and Delivery in Wireless Networks , 2012, IEEE Transactions on Information Theory.

[30]  Urs Niesen,et al.  Coded Caching With Nonuniform Demands , 2017, IEEE Transactions on Information Theory.

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

[32]  T. Charles Clancy,et al.  Improved approximation of storage-rate tradeoff for caching via new outer bounds , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[33]  Jaime Llorca,et al.  Caching and coded multicasting: Multiple groupcast index coding , 2014, 2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP).

[34]  Urs Niesen,et al.  Online Coded Caching , 2013, IEEE/ACM Transactions on Networking.

[35]  Ravi Tandon,et al.  Beyond cut-set bounds - the approximate capacity of D2D networks , 2015, 2015 Information Theory and Applications Workshop (ITA).

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