Coded Caching and Content Delivery With Heterogeneous Distortion Requirements

Cache-aided coded content delivery is studied for devices with diverse quality-of-service requirements, specified by a different average distortion target. The network consists of a server holding a database of independent contents, and users equipped with local caches of different capacities. User caches are filled by the server during a low traffic period without the knowledge of particular user demands. As opposed to the current literature, which assumes that the users request files in their entirety, it is assumed that the users in the system have distinct distortion requirements; and therefore, each user requests a single file from the database to be served at a different distortion level. Our goal in this paper is to characterize the minimum delivery rate the server needs to transmit over an error-free shared link to satisfy all possible demand combinations at the requested distortion levels, considering both centralized and decentralized cache placement. For centralized cache placement, the optimal delivery rate is characterized for the two-file two-user scenario for any pair of target distortion requirements, when the underlying source distribution is successively refinable. For the two-user scenario with more than two successively refinable files, the optimal scheme is characterized when the cache capacities of the users are the same and the number of files is a multiple of 3. For the general source distribution, not necessarily successively refinable, and with arbitrary number of users and files, a layered caching and delivery scheme is proposed, assuming that scalable source coding is employed at the server. This allows dividing the problem into two subproblems: the lossless caching of each layer with heterogeneous cache sizes, and cache allocation among layers. A delivery rate minimization problem is formulated and solved numerically for each layer; while two different schemes are proposed to allocate user caches among layers, namely, proportional cache allocation and ordered cache allocation. A decentralized lossy coded caching scheme is also proposed, and its delivery rate performance is studied. Simulation results validate the effectiveness of the proposed schemes in both settings.

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

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

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

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

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

[6]  Giuseppe Caire,et al.  Fundamental limits of distributed caching in D2D wireless networks , 2013, 2013 IEEE Information Theory Workshop (ITW).

[7]  Deniz Gündüz,et al.  Centralized coded caching for heterogeneous lossy requests , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

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

[9]  Deniz Gündüz,et al.  Interference networks with caches at both ends , 2017, 2017 IEEE International Conference on Communications (ICC).

[10]  Alexandros G. Dimakis,et al.  FemtoCaching: Wireless Content Delivery Through Distributed Caching Helpers , 2013, IEEE Transactions on Information Theory.

[11]  Alexandros G. Dimakis,et al.  FemtoCaching: Wireless video content delivery through distributed caching helpers , 2011, 2012 Proceedings IEEE INFOCOM.

[12]  Kevin C. Almeroth,et al.  The Use of Multicast Delivery to Provide a Scalable and Interactive Video-on-Demand Service , 1996, IEEE J. Sel. Areas Commun..

[13]  Deniz Gündüz,et al.  Decentralized coded caching with distinct cache capacities , 2016, 2016 50th Asilomar Conference on Signals, Systems and Computers.

[14]  William Equitz,et al.  Successive refinement of information , 1991, IEEE Trans. Inf. Theory.

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

[16]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[17]  Xiaofei Wang,et al.  Cache in the air: exploiting content caching and delivery techniques for 5G systems , 2014, IEEE Communications Magazine.

[18]  Aylin Yener,et al.  Device-to-Device Coded Caching with Heterogeneous Cache Sizes , 2018, 2018 IEEE International Conference on Communications (ICC).

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

[20]  Deniz Gündüz,et al.  Cache-Aided Content Delivery Over Erasure Broadcast Channels , 2017, IEEE Transactions on Communications.

[21]  Deniz Gündüz,et al.  Coded caching for a large number of users , 2016, 2016 IEEE Information Theory Workshop (ITW).

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

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

[24]  Deniz Gündüz,et al.  Wireless Content Caching for Small Cell and D2D Networks , 2016, IEEE Journal on Selected Areas in Communications.

[25]  Suhas N. Diggavi,et al.  Hierarchical coded caching , 2014, 2014 IEEE International Symposium on Information Theory.

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

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

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

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

[30]  Heiko Schwarz,et al.  Overview of the Scalable Video Coding Extension of the H.264/AVC Standard , 2007, IEEE Transactions on Circuits and Systems for Video Technology.

[31]  Petros Elia,et al.  Fundamental limits of cache-aided wireless BC: Interplay of coded-caching and CSIT feedback , 2015, 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[32]  Bernhard C. Geiger,et al.  A Rate-Distortion Approach to Caching , 2016, IEEE Transactions on Information Theory.

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

[34]  Michele A. Wigger,et al.  Joint cache-channel coding over erasure broadcast channels , 2015, 2015 International Symposium on Wireless Communication Systems (ISWCS).

[35]  Deniz Gündüz,et al.  Caching and Coded Delivery Over Gaussian Broadcast Channels for Energy Efficiency , 2018, IEEE Journal on Selected Areas in Communications.

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

[37]  Zhi Chen,et al.  Fundamental limits of caching: improved bounds for users with small buffers , 2016, IET Commun..

[38]  Li Fan,et al.  Summary cache: a scalable wide-area web cache sharing protocol , 2000, TNET.

[39]  Thomas Stockhammer,et al.  Dynamic adaptive streaming over HTTP --: standards and design principles , 2011, MMSys.