Device-to-Device Coded-Caching With Distinct Cache Sizes

This paper considers a cache-aided device-to-device (D2D) system where the users are equipped with cache memories of different size. During low traffic hours, a server places content in the users’ cache memories, knowing that the files requested by the users during peak traffic hours will have to be delivered by D2D transmissions only. The worst-case D2D delivery load is minimized by jointly designing the uncoded cache placement and linear coded D2D delivery. Next, a novel lower bound on the D2D delivery load with uncoded placement is proposed and used in explicitly characterizing the minimum D2D delivery load (MD2DDL) with uncoded placement for several cases of interest. In particular, having characterized the MD2DDL for equal cache sizes, it is shown that the same delivery load can be achieved in the network with users of unequal cache sizes, provided that the smallest cache size is greater than a certain threshold. The MD2DDL is also characterized in the small cache size regime, the large cache size regime, and the three-user case. Comparisons of the server-based delivery load with the D2D delivery load are provided. Finally, connections and mathematical parallels between cache-aided D2D systems and coded distributed computing (CDC) systems are discussed.

[1]  Aydin Sezgin,et al.  Fundamental limits of caching in D2D networks with secure delivery , 2015, 2015 IEEE International Conference on Communication Workshop (ICCW).

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

[3]  Deniz Gündüz,et al.  Coded Caching and Content Delivery With Heterogeneous Distortion Requirements , 2016, IEEE Transactions on Information Theory.

[4]  Congduan Li.  On Rate Region of Caching Problems With Non-Uniform File and Cache Sizes , 2017, IEEE Communications Letters.

[5]  Amir Salman Avestimehr,et al.  On Heterogeneous Coded Distributed Computing , 2017, GLOBECOM 2017 - 2017 IEEE Global Communications Conference.

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

[7]  Chi Wan Sung,et al.  Coded caching in partially cooperative D2D communication networks , 2017, 2017 9th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT).

[8]  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).

[9]  Giuseppe Caire,et al.  Fundamental limits of distributed caching in multihop D2D wireless networks , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

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

[11]  Giuseppe Caire,et al.  Fundamental Limits of Decentralized Data Shuffling , 2018, IEEE Transactions on Information Theory.

[12]  T. Charles Clancy,et al.  Layered caching for heterogeneous storage , 2016, 2016 50th Asilomar Conference on Signals, Systems and Computers.

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

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

[15]  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).

[16]  Suhas N. Diggavi,et al.  Coded Caching for Multi-level Popularity and Access , 2014, IEEE Transactions on Information Theory.

[17]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

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

[19]  Hui Liu,et al.  Structural Properties of Uncoded Placement Optimization for Coded Delivery , 2017, ArXiv.

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

[21]  Aylin Yener,et al.  Coded Caching for Heterogeneous Systems: An Optimization Perspective , 2018, IEEE Transactions on Communications.

[22]  Giuseppe Caire,et al.  Wireless Device-to-Device Caching Networks: Basic Principles and System Performance , 2013, IEEE Journal on Selected Areas in Communications.

[23]  Aylin Yener,et al.  On Coded Caching with Heterogeneous Distortion Requirements , 2018, 2018 Information Theory and Applications Workshop (ITA).

[24]  Hung-Yu Wei,et al.  5G Radio Access Network Design with the Fog Paradigm: Confluence of Communications and Computing , 2017, IEEE Communications Magazine.

[25]  Daniela Tuninetti,et al.  A novel index coding scheme and its application to coded caching , 2017, 2017 Information Theory and Applications Workshop (ITA).

[26]  Xinbing Wang,et al.  Coded caching for files with distinct file sizes , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[27]  Deniz Gündüz,et al.  Decentralized Caching and Coded Delivery With Distinct Cache Capacities , 2017, IEEE Transactions on Communications.

[28]  Lele Wang,et al.  On the capacity region for index coding , 2013, 2013 IEEE International Symposium on Information Theory.

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

[30]  A. Salman Avestimehr,et al.  A Fundamental Tradeoff Between Computation and Communication in Distributed Computing , 2016, IEEE Transactions on Information Theory.

[31]  Aylin Yener,et al.  Optimization of heterogeneous caching systems with rate limited links , 2017, 2017 IEEE International Conference on Communications (ICC).

[32]  Urs Niesen,et al.  Coding for caching: fundamental limits and practical challenges , 2016, IEEE Communications Magazine.

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

[34]  Qing Wang,et al.  A Survey on Device-to-Device Communication in Cellular Networks , 2013, IEEE Communications Surveys & Tutorials.

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

[36]  Daniela Tuninetti,et al.  Fundamental Limits of Distributed Data Shuffling , 2018, 2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[37]  Jaime Llorca,et al.  Distortion-memory tradeoffs in cache-aided wireless video delivery , 2015, 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[38]  Seyed Pooya Shariatpanahi,et al.  Mobility increases throughput of wireless device-to-device networks with coded caching , 2016, 2016 IEEE International Conference on Communications (ICC).

[39]  Suhas N. Diggavi,et al.  Effect of number of users in multi-level coded caching , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[40]  Aylin Yener,et al.  Device-to-Device Secure Coded Caching , 2018, IEEE Transactions on Information Forensics and Security.