{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:35:50Z","timestamp":1760240150379,"version":"build-2065373602"},"reference-count":70,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2019,3,25]],"date-time":"2019-03-25T00:00:00Z","timestamp":1553472000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1824558, 1817154, 1619129"],"award-info":[{"award-number":["1824558, 1817154, 1619129"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Coded multicasting has been shown to be a promising approach to significantly improve the performance of content delivery networks with multiple caches downstream of a common multicast link. However, the schemes that have been shown to achieve order-optimal performance require content items to be partitioned into several packets that grows exponentially with the number of caches, leading to codes of exponential complexity that jeopardize their promising performance benefits. In this paper, we address this crucial performance-complexity tradeoff in a heterogeneous caching network setting, where edge caches with possibly different storage capacity collect multiple content requests that may follow distinct demand distributions. We extend the asymptotic (in the number of packets per file) analysis of shared link caching networks to heterogeneous network settings, and present novel coded multicast schemes, based on local graph coloring, that exhibit polynomial-time complexity in all the system parameters, while preserving the asymptotically proven multiplicative caching gain even for finite file packetization. We further demonstrate that the packetization order (the number of packets each file is split into) can be traded-off with the number of requests collected by each cache, while preserving the same multiplicative caching gain. Simulation results confirm the superiority of the proposed schemes and illustrate the interesting request aggregation vs. packetization order tradeoff within several practical settings. Our results provide a compelling step towards the practical achievability of the promising multiplicative caching gain in next generation access networks.<\/jats:p>","DOI":"10.3390\/e21030324","type":"journal-article","created":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T03:50:21Z","timestamp":1553831421000},"page":"324","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Efficient Algorithms for Coded Multicasting in Heterogeneous Caching Networks"],"prefix":"10.3390","volume":"21","author":[{"given":"Giuseppe","family":"Vettigli","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering and Information Technology (DIETI), Universit\u00e1 di Napoli Federico II, 80138 Napoli, Italy"}]},{"given":"Mingyue","family":"Ji","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering (ECE), University of Utah, Salt Lake City, UT 84112, USA"}]},{"given":"Karthikeyan","family":"Shanmugam","sequence":"additional","affiliation":[{"name":"IBM Research, New York, NY 10598, USA"}]},{"given":"Jaime","family":"Llorca","sequence":"additional","affiliation":[{"name":"Department of Math and Algorithms, Nokia Bell Labs, Murray Hill, NJ 07738, USA"}]},{"given":"Antonia M.","family":"Tulino","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering and Information Technology (DIETI), Universit\u00e1 di Napoli Federico II, 80138 Napoli, Italy"},{"name":"Department of Math and Algorithms, Nokia Bell Labs, Murray Hill, NJ 07738, USA"}]},{"given":"Giuseppe","family":"Caire","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering and Computer Science (EECS), Technical University of Berlin, 10587 Berlin, Germany"}]}],"member":"1968","published-online":{"date-parts":[[2019,3,25]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"8402","DOI":"10.1109\/TIT.2013.2281606","article-title":"FemtoCaching: Wireless Video Content Delivery through Distributed Caching Helpers","volume":"59","author":"Shanmugam","year":"2013","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Llorca, J., Tulino, A., Guan, K., and Kilper, D. (2013, January 9\u201313). Network-Coded Caching-Aided Multicast for Efficient Content Delivery. Proceedings of the 2013 IEEE International Conference on Communications (ICC), Budapest, Hungary.","DOI":"10.1109\/ICC.2013.6655103"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1109\/MCOM.2017.1600449CM","article-title":"Coding for Caching in 5G Networks","volume":"55","author":"Fadlallah","year":"2017","journal-title":"IEEE Commun. Mag."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1109\/MCOM.2016.7565183","article-title":"Caching at the wireless edge: Design aspects, challenges, and future directions","volume":"54","author":"Liu","year":"2016","journal-title":"IEEE Commun. Mag."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1109\/MCOM.2016.7537176","article-title":"Harnessing cloud and edge synergies: Toward an information theory of fog radio access networks","volume":"54","author":"Tandon","year":"2016","journal-title":"IEEE Commun. Mag."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1109\/MCOM.2016.7537173","article-title":"Coding for caching: Fundamental limits and practical challenges","volume":"54","author":"Niesen","year":"2016","journal-title":"IEEE Commun. Mag."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1109\/MCOM.2016.7537172","article-title":"Wireless caching: Technical misconceptions and business barriers","volume":"54","author":"Paschos","year":"2016","journal-title":"IEEE Commun. Mag."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"2856","DOI":"10.1109\/TIT.2014.2306938","article-title":"Fundamental Limits of Caching","volume":"60","author":"Niesen","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Maddah-Ali, M., and Niesen, U. (2014). Decentralized Coded Caching Attains Order-Optimal Memory-Rate Tradeoff. IEEE\/ACM Trans. Netw.","DOI":"10.1109\/Allerton.2013.6736555"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Ji, M., Tulino, A., Llorca, J., and Caire, G. (2014, January 26\u201329). On the average performance of caching and coded multicasting with random demands. Proceedings of the 2014 11th International Symposium on Wireless Communications Systems (ISWCS), Barcelona, Spain.","DOI":"10.1109\/ISWCS.2014.6933485"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1146","DOI":"10.1109\/TIT.2016.2639522","article-title":"Coded Caching With Nonuniform Demands","volume":"63","author":"Niesen","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"3923","DOI":"10.1109\/TIT.2017.2695611","article-title":"Order-Optimal Rate of Caching and Coded Multicasting with Random Demands","volume":"63","author":"Ji","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Ji, M., Tulino, A., Llorca, J., and Caire, G. (2014, January 3\u20135). Caching and Coded Multicasting: Multiple Groupcast Index Coding. Proceedings of the 2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP), Atlanta, GA, USA.","DOI":"10.1109\/GlobalSIP.2014.7032246"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Ji, M., Tulino, A.M., Llorca, J., and Caire, G. (May, January 26). Caching-Aided Coded Multicasting with Multiple Random Requests. Proceedings of the 2015 IEEE Information Theory Workshop (ITW), Jerusalem, Israel.","DOI":"10.1109\/ITW.2015.7133172"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Wan, K., Tuninetti, D., and Piantanida, P. (2016, January 10\u201315). On caching with more users than files. Proceedings of the 2016 IEEE International Symposium on Information Theory (ISIT), Barcelona, Spain.","DOI":"10.1109\/ISIT.2016.7541276"},{"key":"ref_16","unstructured":"Wan, K., Tuninetti, D., and Piantanida, P. (2016, January 11\u201314). On the optimality of uncoded cache placement. Proceedings of the 2016 IEEE Information Theory Workshop (ITW), Cambridge, UK."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"6833","DOI":"10.1109\/TIT.2015.2490226","article-title":"The Throughput-Outage Tradeoff of Wireless One-Hop Caching Networks","volume":"61","author":"Ji","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1109\/TIT.2015.2504556","article-title":"Fundamental Limits of Caching in Wireless D2D Networks","volume":"62","author":"Ji","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1109\/JSAC.2015.2452672","article-title":"Wireless Device-to-Device Caching Networks: Basic Principles and System Performance","volume":"34","author":"Ji","year":"2016","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"2207","DOI":"10.1109\/JSAC.2016.2577198","article-title":"Speeding Up Future Video Distribution via Channel-Aware Caching-Aided Coded Multicast","volume":"34","author":"Cacciapuoti","year":"2016","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"5524","DOI":"10.1109\/TIT.2016.2599110","article-title":"Finite-Length Analysis of Caching-Aided Coded Multicasting","volume":"62","author":"Shanmugam","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"5755","DOI":"10.1109\/TIT.2018.2847679","article-title":"Centralized Coded Caching Schemes: A Hypergraph Theoretical Approach","volume":"64","author":"Shangguan","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"2315","DOI":"10.1049\/iet-com.2015.1205","article-title":"Fundamental limits of caching: Improved bounds for users with small buffers","volume":"10","author":"Chen","year":"2016","journal-title":"IET Commun."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"3212","DOI":"10.1109\/TIT.2016.2557804","article-title":"Hierarchical Coded Caching","volume":"62","author":"Karamchandani","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1109\/TNET.2015.2394482","article-title":"Online Coded Caching","volume":"24","author":"Pedarsani","year":"2016","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Sahraei, S., and Gastpar, M. (2016, January 16\u201318). K users caching two files: An improved achievable rate. Proceedings of the 2016 Annual Conference on Information Science and Systems (CISS), Princeton, NJ, USA.","DOI":"10.1109\/CISS.2016.7460574"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"6393","DOI":"10.1109\/TIT.2016.2604851","article-title":"Information-Theoretic Caching: Sequential Coding for Computing","volume":"62","author":"Wang","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_28","unstructured":"G\u00f3mez-Vilardeb\u00f3, J. (arXiv, 2016). Fundamental limits of caching: Improved bounds with coded prefetching, arXiv."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"7253","DOI":"10.1109\/TIT.2016.2614722","article-title":"Multi-Server Coded Caching","volume":"62","author":"Shariatpanahi","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Shanmugam, K., Tulino, A.M., and Dimakis, A.G. (2017, January 25\u201330). Coded caching with linear subpacketization is possible using Ruzsa-Szem\u00e9redi graphs. Proceedings of the 2017 IEEE International Symposium on Information Theory (ISIT), Aachen, Germany.","DOI":"10.1109\/ISIT.2017.8006726"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"4388","DOI":"10.1109\/TIT.2017.2705166","article-title":"Improved Lower Bounds for Coded Caching","volume":"63","author":"Ghasemi","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"7018","DOI":"10.1109\/TIT.2017.2733527","article-title":"Information-Theoretic Caching: The Multi-User Case","volume":"63","author":"Lim","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"1662","DOI":"10.1109\/TIT.2017.2654341","article-title":"Wireless Multihop Device-to-Device Caching Networks","volume":"63","author":"Jeon","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"1940","DOI":"10.1109\/TCOMM.2017.2664815","article-title":"Improved Approximation of Storage-Rate Tradeoff for Caching With Multiple Demands","volume":"65","author":"Sengupta","year":"2017","journal-title":"IEEE Trans. Commun."},{"key":"ref_35","first-page":"3108","article-title":"Coded Caching for Multi-level Popularity and Access","volume":"63","author":"Hachem","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Ji, M., Wong, M.F., Tulino, A.M., Llorca, J., Caire, G., Effros, M., and Langberg, M. (July, January 28). On the fundamental limits of caching in combination networks. Proceedings of the 2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), Stockholm, Sweden.","DOI":"10.1109\/SPAWC.2015.7227127"},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Ji, M., Tulino, A.M., Llorca, J., and Caire, G. (2015, January 8). Caching in combination networks. Proceedings of the 2015 49th Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, USA.","DOI":"10.1109\/ACSSC.2015.7421346"},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Wan, K., Ji, M., Piantanida, P., and Tuninetti, D. (2017, January 6\u201310). Novel outer bounds for combination networks with end-user-caches. Proceedings of the 2017 IEEE Information Theory Workshop (ITW), Kaohsiung, Taiwan.","DOI":"10.1109\/ITW.2017.8277986"},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Wan, K., Tuninetti, D., Ji, M., and Piantanida, P. (November, January 29). State-of-the-art in cache-aided combination networks. Proceedings of the 2017 51st Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA, USA.","DOI":"10.1109\/ACSSC.2017.8335420"},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Wan, K., Ji, M., Piantanida, P., and Tuninetti, D. (2018, January 20\u201324). Caching in Combination Networks: Novel Multicast Message Generation and Delivery by Leveraging the Network Topology. Proceedings of the 2018 IEEE International Conference on Communications (ICC), Kansas City, MO, USA.","DOI":"10.1109\/ICC.2018.8422197"},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Wan, K., Jit, M., Piantanida, P., and Tuninetti, D. (2018, January 17\u201322). On the Benefits of Asymmetric Coded Cache Placement in Combination Networks with End-User Caches. Proceedings of the 2018 IEEE International Symposium on Information Theory (ISIT), Vail, CO, USA.","DOI":"10.1109\/ISIT.2018.8437462"},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Wan, K., Tuninetti, D., Ji, M., and Piantanida, P. (2018, January 11\u201316). A Novel Asymmetric Coded Placement in Combination Networks with End-User Caches. Proceedings of the 2018 Information Theory and Applications Workshop (ITA), San Diego, CA, USA.","DOI":"10.1109\/ITA.2018.8503093"},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"1548","DOI":"10.1109\/TIT.2018.2794543","article-title":"Caching and Delivery via Interference Elimination","volume":"64","author":"Tian","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"1281","DOI":"10.1109\/TIT.2017.2785237","article-title":"The Exact Rate-Memory Tradeoff for Caching With Uncoded Prefetching","volume":"64","author":"Yu","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"1153","DOI":"10.1109\/JSAC.2018.2844958","article-title":"Fundamental Limits of Coded Caching: From Uncoded Prefetching to Coded Prefetching","volume":"36","author":"Zhang","year":"2018","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"7051","DOI":"10.1109\/TIT.2018.2856885","article-title":"Improved Converses and Gap Results for Coded Caching","volume":"64","author":"Wang","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1109\/TIT.2018.2870566","article-title":"Characterizing the Rate-Memory Tradeoff in Cache Networks Within a Factor of 2","volume":"65","author":"Yu","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_48","doi-asserted-by":"crossref","unstructured":"Karat, N.S., Thomas, A., and Rajan, B.S. (2018, January 17\u201322). Optimal Error Correcting Delivery Scheme for an Optimal Coded Caching Scheme with Small Buffers. Proceedings of the 2018 IEEE International Symposium on Information Theory (ISIT), Vail, CO, USA.","DOI":"10.1109\/ISIT.2018.8437649"},{"key":"ref_49","doi-asserted-by":"crossref","unstructured":"Tian, C. (2018). Symmetry, Outer Bounds, and Code Constructions: A Computer-Aided Investigation on the Fundamental Limits of Caching. Entropy, 20.","DOI":"10.3390\/e20080603"},{"key":"ref_50","unstructured":"Cisco (2013). The Zettabyte Era-Trends and Analysis, Cisco. Cisco White Paper."},{"key":"ref_51","unstructured":"Birk, Y., and Kol, T. (April, January 29). Informed-source coding-on-demand (ISCOD) over broadcast channels. Proceedings of the Conference on Computer Communications, Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies, Gateway to the 21st Century, San Francisco, CA, USA."},{"key":"ref_52","doi-asserted-by":"crossref","unstructured":"Breslau, L., Cao, P., Fan, L., Phillips, G., and Shenker, S. (1999, January 21\u201325). Web caching and Zipf-like distributions: Evidence and implications. Proceedings of the INFOCOM\u201999: Conference on Computer Communications, New York, NY, USA.","DOI":"10.1109\/INFCOM.1999.749260"},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"3099","DOI":"10.1109\/TIT.2018.2800059","article-title":"Coded Caching Schemes With Reduced Subpacketization From Linear Block Codes","volume":"64","author":"Tang","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_54","first-page":"5821","article-title":"On the Placement Delivery Array Design for Centralized Coded Caching Scheme","volume":"63","author":"Yan","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_55","doi-asserted-by":"crossref","unstructured":"Vettigli, G., Ji, M., Tulino, A.M., Llorca, J., and Festa, P. (May, January 26). An efficient coded multicasting scheme preserving the multiplicative caching gain. Proceedings of the 2015 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), Hong Kong, China.","DOI":"10.1109\/INFCOMW.2015.7179393"},{"key":"ref_56","doi-asserted-by":"crossref","unstructured":"Ji, M., Shanmugam, K., Vettigli, G., Llorca, J., Tulino, A.M., and Caire, G. (2015, January 8\u201312). An efficient multiple-groupcast coded multicasting scheme for finite fractional caching. Proceedings of the 2015 IEEE International Conference on Communications (ICC), London, UK.","DOI":"10.1109\/ICC.2015.7248916"},{"key":"ref_57","doi-asserted-by":"crossref","unstructured":"Ramakrishnan, A., Westphal, C., and Markopoulou, A. (2015, January 8\u201310). An Efficient Delivery Scheme for Coded Caching. Proceedings of the 2015 27th International Teletraffic Congress, Ghent, Belgium.","DOI":"10.1109\/ITC.2015.13"},{"key":"ref_58","doi-asserted-by":"crossref","unstructured":"Jin, S., Cui, Y., Liu, H., and Caire, G. (2016, January 4\u20138). Order-Optimal Decentralized Coded Caching Schemes with Good Performance in Finite File Size Regime. Proceedings of the 2016 IEEE Global Communications Conference (GLOBECOM), Washington, DC, USA.","DOI":"10.1109\/GLOCOM.2016.7842115"},{"key":"ref_59","unstructured":"Wan, K., Tuninetti, D., and Piantanida, P. (2017, January 21\u201325). Novel delivery schemes for decentralized coded caching in the finite file size regime. Proceedings of the 2017 IEEE International Conference on Communications Workshops (ICC Workshops), Paris, France."},{"key":"ref_60","doi-asserted-by":"crossref","unstructured":"Asghari, S.M., Ouyang, Y., Nayyar, A., and Avestimehr, A.S. (2018, January 20\u201324). Optimal Coded Multicast in Cache Networks with Arbitrary Content Placement. Proceedings of the 2018 IEEE International Conference on Communications (ICC), Kansas City, MO, USA.","DOI":"10.1109\/ICC.2018.8422194"},{"key":"ref_61","doi-asserted-by":"crossref","unstructured":"Amiri, M.M., Yang, Q., and G\u00fcnd\u00fcz, D. (2016, January 6\u20139). Decentralized coded caching with distinct cache capacities. Proceedings of the 2016 50th Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, USA.","DOI":"10.1109\/ACSSC.2016.7869142"},{"key":"ref_62","doi-asserted-by":"crossref","first-page":"4657","DOI":"10.1109\/TCOMM.2017.2734767","article-title":"Decentralized Caching and Coded Delivery With Distinct Cache Capacities","volume":"65","author":"Amiri","year":"2017","journal-title":"IEEE Trans. Commun."},{"key":"ref_63","doi-asserted-by":"crossref","unstructured":"Ibrahim, A.M., Zewail, A.A., and Yener, A. (2017, January 19\u201322). Centralized Coded Caching with Heterogeneous Cache Sizes. Proceedings of the 2017 IEEE Wireless Communications and Networking Conference (WCNC), San Francisco, CA, USA.","DOI":"10.1109\/WCNC.2017.7925535"},{"key":"ref_64","doi-asserted-by":"crossref","unstructured":"Wei, Y., and Ulukus, S. (2017, January 3\u20136). Coded caching with multiple file requests. Proceedings of the 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton), Monticello, IL, USA.","DOI":"10.1109\/ALLERTON.2017.8262770"},{"key":"ref_65","doi-asserted-by":"crossref","unstructured":"Parrinello, E., Unsal, A., and Elia, P. (arXiv, 2018). Fundamental Limits of Caching in Heterogeneous Networks with Uncoded Prefetching, arXiv.","DOI":"10.1109\/ITW.2018.8613363"},{"key":"ref_66","doi-asserted-by":"crossref","unstructured":"Shanmugam, K., Dimakis, A.G., and Langberg, M. (2013, January 7\u201312). Local graph coloring and index coding. Proceedings of the 2013 IEEE International Symposium on Information Theory, Istanbul, Turkey.","DOI":"10.1109\/ISIT.2013.6620407"},{"key":"ref_67","unstructured":"Lin, S., and Costello, D.J. (2004). Error Control Coding, Prentice-hall Englewood Cliffs."},{"key":"ref_68","doi-asserted-by":"crossref","first-page":"1479","DOI":"10.1109\/TIT.2010.2103753","article-title":"Index coding with side information","volume":"57","author":"Birk","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_69","doi-asserted-by":"crossref","first-page":"1352","DOI":"10.1109\/TC.2001.970573","article-title":"LRFU: A spectrum of policies that subsumes the least recently used and least frequently used policies","volume":"50","author":"Lee","year":"2001","journal-title":"IEEE Trans. Comput."},{"key":"ref_70","doi-asserted-by":"crossref","unstructured":"Boucheron, S., Lugosi, G., and Massart, P. (2013). Concentration Inequalities: A Nonasymptotic Theory of Independence, Oxford University Press.","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/21\/3\/324\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T12:40:35Z","timestamp":1760186435000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/21\/3\/324"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,25]]},"references-count":70,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2019,3]]}},"alternative-id":["e21030324"],"URL":"https:\/\/doi.org\/10.3390\/e21030324","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2019,3,25]]}}}