{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T13:36:09Z","timestamp":1762522569572,"version":"build-2065373602"},"reference-count":35,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2021,3,27]],"date-time":"2021-03-27T00:00:00Z","timestamp":1616803200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100010661","name":"Horizon 2020 Framework Programme","doi-asserted-by":"publisher","award":["815074","825012"],"award-info":[{"award-number":["815074","825012"]}],"id":[{"id":"10.13039\/100010661","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Internet"],"abstract":"<jats:p>Network caching is a technique used to speed-up user access to frequently requested contents in complex data networks. This paper presents a two-layer overlay network caching system for content distribution. It is used to define some caching scenarios with increasing complexity, which refers to real situations, including mobile 5G connectivity. For each scenario our aim is to maximize the hit ratio, which leads to the formulation of NP-complete optimization problems. The heuristic solutions proposed are based on the theory of the maximization of monotone submodular functions under matroid constraints. After the determination of the approximation ratio of the greedy heuristic algorithms proposed, a numerical performance analysis is shown. This analysis includes a comparison with the Least-Frequently Used (LFU) eviction strategy adapted to the analyzed systems. Results show very good performance, under the hypotheses of either known or unknown popularity of contents.<\/jats:p>","DOI":"10.3390\/fi13040085","type":"journal-article","created":{"date-parts":[[2021,3,28]],"date-time":"2021-03-28T22:09:01Z","timestamp":1616969341000},"page":"85","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Two-Layer Network Caching for Different Service Requirements"],"prefix":"10.3390","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8567-5917","authenticated-orcid":false,"given":"Gianluca","family":"Reali","sequence":"first","affiliation":[{"name":"Department of Engineering, University of Perugia, 06125 Perugia, Italy"},{"name":"Consorzio Nazionale Interuniversitario per le Telecomunicazioni (CNIT), 43124 Parma, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6695-5956","authenticated-orcid":false,"given":"Mauro","family":"Femminella","sequence":"additional","affiliation":[{"name":"Department of Engineering, University of Perugia, 06125 Perugia, Italy"},{"name":"Consorzio Nazionale Interuniversitario per le Telecomunicazioni (CNIT), 43124 Parma, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2021,3,27]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1002","DOI":"10.1109\/COMST.2016.2626384","article-title":"A Survey on Replica Server Placement Algorithms for Content Delivery Networks","volume":"19","author":"Sahoo","year":"2017","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Ghabashneh, E., and Rao, S. (2020, January 6\u20139). Exploring the interplay between CDN caching and video streaming performance. Proceedings of the IEEE INFOCOM 2020\u2014IEEE Conference on Computer Communications, Toronto, ON, Canada.","DOI":"10.1109\/INFOCOM41043.2020.9155338"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"5982","DOI":"10.1109\/ACCESS.2017.2689678","article-title":"CaaS: Caching as a Service for 5G Networks","volume":"5","author":"Li","year":"2017","journal-title":"IEEE Access"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Femminella, M., Reali, G., and Valocchi, D. (2017, January 3\u20137). Genome centric networking: A network function virtualization solution for genomic applications. Proceedings of the 2017 IEEE Conference on Network Softwarization (NetSoft), Bologna, Italy.","DOI":"10.1109\/NETSOFT.2017.8004111"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/MCOM.2012.6231276","article-title":"A survey of information-centric networking","volume":"50","author":"Ahlgren","year":"2012","journal-title":"IEEE Commun. Mag."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Zhang, G., Li, Y., and Lin, T. (2013). Caching in information centric networking: A survey. Comput. Netw., 57.","DOI":"10.1016\/j.comnet.2013.07.007"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Adhikari, V.K., Jain, S., Chen, Y., and Zhang, Z. (2012, January 25\u201330). Vivisecting YouTube: An active measurement study. Proceedings of the 2012 Proceedings IEEE INFOCOM, Orlando, FL, USA.","DOI":"10.1109\/INFCOM.2012.6195644"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Huang, Q., Birman, K., van Renesse, R., Lloyd, W., Kumar, S., and Li, H.C. (2013, January 3\u20136). An Analysis of Facebook Photo Caching. Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles, Farminton, PA, USA.","DOI":"10.1145\/2517349.2522722"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Bellante, W., Vilardi, R., and Rossi, D. (2013, January 25\u201327). On Netflix catalog dynamics and caching performance. Proceedings of the 2013 IEEE 18th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD), Berlin, Germany.","DOI":"10.1109\/CAMAD.2013.6708095"},{"key":"ref_10","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_11","doi-asserted-by":"crossref","first-page":"1472","DOI":"10.1109\/TNET.2012.2227338","article-title":"Estimating Instantaneous Cache Hit Ratio Using Markov Chain Analysis","volume":"21","author":"Gomaa","year":"2013","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/954339.954341","article-title":"A survey of Web cache replacement strategies","volume":"35","author":"Podlipnig","year":"2003","journal-title":"ACM Comput. Surv."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"2040","DOI":"10.1145\/2896380","article-title":"A Unified Approach to the Performance Analysis of Caching Systems","volume":"1","author":"Garetto","year":"2016","journal-title":"ACM Trans. Model. Perform. Eval. Comput. Syst."},{"key":"ref_14","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 1999, New York, NY, USA.","DOI":"10.1109\/INFCOM.1999.749260"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Gill, M.A.P., Li, Z., and Mahanti, A. (2007, January 24\u201326). Youtube traffic characterization: A view from the edge. Proceedings of the 7th ACM IMC, San Diego, CA, USA.","DOI":"10.1145\/1298306.1298310"},{"key":"ref_16","unstructured":"Fricker, P.C., and Robert, J.R. (2012, January 4\u20137). A Versatile and Accurate Approximation for LRU Cache Performance. Proceedings of the 2012 24th International Teletraffic Congress (ITC 24), Krakow, Poland."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Alghamdi, F., Mahfoudh, S., and Barnawi, A. (2019). A Novel Fog Computing Based Architecture to Improve the Performance in Content Delivery Networks. Wirel. Commun. Mob. Comput., 2019.","DOI":"10.1155\/2019\/7864094"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Wang, Y., and Friderikos, V. (2020). A Survey of Deep Learning for Data Caching in Edge Network. Informatics, 7.","DOI":"10.3390\/informatics7040043"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Einziger, G., and Friedman, R. (2014, January 11\u201313). TinyLFU: A Highly Efficient Cache Admission Policy. Proceedings of the 2014 22nd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, Vasteras, Sweden.","DOI":"10.1109\/PDP.2014.34"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Robinson, J., and Devarakonda, M. (1990, January 22\u201325). Data Cache Management Using Frequency-Based Replacement, SIGMETRICS-90. Proceedings of the 1990 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, Boulder, CO, USA.","DOI":"10.1145\/98457.98523"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1692","DOI":"10.1109\/ACCESS.2017.2669344","article-title":"A Cache Management Scheme for Efficient Content Eviction and Replication in Cache Networks","volume":"5","author":"Bilal","year":"2017","journal-title":"IEEE Access"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Borst, S., Gupta, V., and Walid, A. (2010, January 14\u201319). Distributed Caching Algorithms for Content Distribution Networks. Proceedings of the 2010 Proceedings IEEE INFOCOM, San Diego, CA, USA.","DOI":"10.1109\/INFCOM.2010.5461964"},{"key":"ref_23","first-page":"609","article-title":"The LCD interconnection of LRU caches and its analysis","volume":"63","author":"Laoutarisa","year":"2006","journal-title":"IEEE Access"},{"key":"ref_24","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_25","unstructured":"Zhou, Y., and Philbin, J.F. (2001, January 25\u201330). The Multi-Queue Replacement Algorithm for Second Level Buffer Caches. Proceedings of the USENIX 2001, Boston, MA, USA."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Rosensweig, E.J., Kurose, J., and Towsley, D. (2010, January 14\u201319). Approximate Models for General Cache Networks. Proceedings of the 2010 IEEE INFOCOM, San Diego, CA, USA.","DOI":"10.1109\/INFCOM.2010.5461936"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1109\/JSAC.2002.801752","article-title":"Hierarchical Web Caching Systems: Modeling, Design and Experimental Results","volume":"20","author":"Che","year":"2002","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_28","first-page":"1","article-title":"Analysis of TTL-based Cache Networks\u201d Computer Networks","volume":"65","author":"Fofack","year":"2014","journal-title":"Comput. Netw."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1016\/j.comnet.2016.10.004","article-title":"Design and evaluation of coordinated in-network caching model for content centric networking","volume":"110","author":"Xu","year":"2016","journal-title":"Comput. Netw."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Ioannidis, S., and Yeh, E. (2017, January 26\u201328). Jointly Optimal Routing and Caching for Arbitrary Network Topologies. Proceedings of the ACM ICN \u201917, Berlin, Germany.","DOI":"10.1145\/3125719.3125730"},{"key":"ref_31","unstructured":"Pietzuch, P., Shneidman., J., Welsh, M., Seltzer, M., and Roussopoulos, M. (2004). Path Optimization in Stream-Based Overlay Networks, Harvard University. Technical Report."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"1740","DOI":"10.1137\/080733991","article-title":"Maximizing a Monotone Submodular Function Subject to a Matroid Constraint","volume":"40","author":"Calinescu","year":"2009","journal-title":"SIAM J. Comput."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Dyer, M. (2003, January 9\u201311). Approximate counting by dynamic programming. Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, San Diego, CA, USA.","DOI":"10.1145\/780542.780643"},{"key":"ref_34","first-page":"275","article-title":"Knapsack Cover Subject to a Matroid Constraint","volume":"Volume 24","author":"Seth","year":"2013","journal-title":"FSTTCS 2013"},{"key":"ref_35","unstructured":"(2021, March 26). Simulation Package. Available online: http:\/\/conan.diei.unipg.it\/pub\/caching_code.zip."}],"container-title":["Future Internet"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-5903\/13\/4\/85\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T14:10:12Z","timestamp":1760364612000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-5903\/13\/4\/85"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,27]]},"references-count":35,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2021,4]]}},"alternative-id":["fi13040085"],"URL":"https:\/\/doi.org\/10.3390\/fi13040085","relation":{},"ISSN":["1999-5903"],"issn-type":[{"type":"electronic","value":"1999-5903"}],"subject":[],"published":{"date-parts":[[2021,3,27]]}}}