{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:26:10Z","timestamp":1760239570773,"version":"build-2065373602"},"reference-count":26,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T00:00:00Z","timestamp":1607472000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100010447","name":"Kementerian Riset, Teknologi dan Pendidikan Tinggi","doi-asserted-by":"publisher","award":["B\/865\/D3.2\/KD.02.00\/2019"],"award-info":[{"award-number":["B\/865\/D3.2\/KD.02.00\/2019"]}],"id":[{"id":"10.13039\/501100010447","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Internet"],"abstract":"<jats:p>The communication network is growing with some unique characteristics, such as consumers repeatedly request the same content to the server, similarity in local demand trend, and dynamic changes to requests within a specific period. Therefore, a different network paradigm is needed to replace the IP network, namely Named Data Network (NDN). The content store, which acts as a crucial component in the NDN nodes is a limited resource. In addition, a cache mechanism is needed to optimize the router\u2019s content store by exploiting the different content services characters in the network. This paper proposes a new caching algorithm called Cache Based on Popularity and Class (CAPIC) with dynamic mechanism, and the detail explanation about the static method also presented. The goal of Static-CAPIC was to enhance the total cache hit ratio on the network by pre-determining the cache proportion for each content class. However, this technique is not appropriate to control the cache hit ratio for priority class. Therefore, the Dynamic-CAPIC is used to provide flexibility to change the cache proportion based on the frequency of requests in real-time. The formula involves considering the consumers\u2019 request all the time. It gives a higher cache hit ratio for the priority content class. This method outperforms Static-CAPIC, and the LCD+sharing scheme in the total network cache hit ratio parameter and channels it to the priority class.<\/jats:p>","DOI":"10.3390\/fi12120227","type":"journal-article","created":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T09:17:58Z","timestamp":1607505478000},"page":"227","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Performance Analysis of Cache Based on Popularity and Class in Named Data Network"],"prefix":"10.3390","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8045-558X","authenticated-orcid":false,"given":"Leanna Vidya","family":"Yovita","sequence":"first","affiliation":[{"name":"School of Electrical Engineering and Informatics, Institut Teknologi Bandung, Kota Bandung 40132, Indonesia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6682-6487","authenticated-orcid":false,"given":"Nana Rachmana","family":"Syambas","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering and Informatics, Institut Teknologi Bandung, Kota Bandung 40132, Indonesia"}]},{"given":"Ian Joseph Matheus","family":"Edward","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering and Informatics, Institut Teknologi Bandung, Kota Bandung 40132, Indonesia"}]},{"given":"Noriaki","family":"Kamiyama","sequence":"additional","affiliation":[{"name":"Department of Electronics Engineering and Computer Science, Fukuoka University, Fukuoka 814-0180, Japan"}]}],"member":"1968","published-online":{"date-parts":[[2020,12,9]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1109\/MCOM.2011.5723809","article-title":"A survey on content-oriented networking for efficient content delivery","volume":"49","author":"Choi","year":"2011","journal-title":"IEEE Commun. Mag."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1109\/TNSM.2019.2898229","article-title":"Dispersing Content Over Networks in Information-Centric Networking","volume":"16","author":"Kamiyama","year":"2019","journal-title":"IEEE Trans. Netw. Serv. Manag."},{"key":"ref_3","unstructured":"Jing, Y. (2016). Evaluating Caching Mechanisms In Future Internet Architectures, Massachusetts Institute of Technology. Technical Report."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s13638-017-0806-6","article-title":"Information-centric mobile caching network frameworks and caching optimization: A survey","volume":"2017","author":"Jin","year":"2017","journal-title":"Eurasip J. Wirel. Commun. Netw."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.cosrev.2016.01.001","article-title":"ScienceDirect Named Data Networking: A survey","volume":"19","author":"Saxena","year":"2016","journal-title":"Comput. Sci. Rev."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1145\/2063176.2063204","article-title":"Networking named content","volume":"55","author":"Jacobson","year":"2012","journal-title":"Commun. ACM"},{"key":"ref_7","first-page":"87","article-title":"The Effect of Cache Partitioning and Sharing on Named Data Network","volume":"11","author":"Yovita","year":"2019","journal-title":"Internetwork. Indones. J."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Chu, W., Dehghan, M., Towsley, D., and Zhang, Z.L. (2016, January 26\u201328). On allocating cache resources to content providers. Proceedings of the 2016 3rd ACM Conference on Information-Centric Networking (ACM-ICN 2016), Kyoto, Japan.","DOI":"10.1145\/2984356.2984371"},{"key":"ref_9","unstructured":"Zhang, W., Fan, R., Liu, F., and Lai, P. (2015, January 14\u201317). Energy-Aware Caching. Proceedings of the IEEE 21st International Conference on Parallel and Distributed Systems, Melbourne, Australia."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Zheng, X., and Wang, G. (2019). A Cache Placement Strategy with Energy Consumption Optimization in Information-Centric Networking. Future Internet, 11.","DOI":"10.3390\/fi11030064"},{"key":"ref_11","first-page":"4456","article-title":"Caching on named data network: A survey and future research","volume":"8","author":"Yovita","year":"2018","journal-title":"Int. J. Electr. Comput. Eng."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.jnca.2015.09.011","article-title":"Differentiated forwarding and caching in named-data networking","volume":"60","author":"Yusung","year":"2016","journal-title":"J. Netw. Comput. Appl."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.procs.2014.05.399","article-title":"Data lifetime enhancement for improving Qos in NDN","volume":"32","author":"Wu","year":"2014","journal-title":"Procedia Comput. Sci."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Zhang, R., Liu, J., Xie, R., Huang, T., Yu, F.R., and Liu, Y. (2020). Service-aware optimal caching placement for named data networking. Comput. Netw., 174.","DOI":"10.1016\/j.comnet.2020.107193"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Carofiglio, G., Gehlen, V., and Perino, D. (2011, January 5\u20139). Experimental evaluation of memory management in content-centric networking. Proceedings of the IEEE International Conference on Communications, Kyoto, Japan.","DOI":"10.1109\/icc.2011.5962739"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Cho, K., Lee, M., Park, K., Kwon, T.T., Choi, Y., and Pack, S. (2012, January 25\u201330). WAVE: Popularity-based and collaborative in-network caching for content-oriented networks. Proceedings of the IEEE INFOCOM Workshops, Orlando, FL, USA.","DOI":"10.1109\/INFCOMW.2012.6193512"},{"key":"ref_17","unstructured":"Sandvine Intelligent Broadband Network (2015). Identifying and Measuring Internet Traffic: Techniques and Considerations, Sandvine Intelligent Broadband Network. An Industry Whitepaper."},{"key":"ref_18","unstructured":"Cantor, L. (2020, December 09). Phenomena Report. Available online: http:\/\/www.fullertreacymoney.com\/system\/data\/files\/PDFs\/2020\/May\/COVID%20Internet%20Phenomena%20Report%2020200507.pdf."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1109\/COMST.2019.2894816","article-title":"Named Data Networking in Vehicular Ad hoc Networks: State-of-the-Art and Challenges","volume":"22","author":"Khelifi","year":"2020","journal-title":"Commun. Surv. Tutor."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Yovita, L.V., Syambas, N.R., Yosef, I., and Edward, M. (2018, January 5\u20137). CAPIC: Cache based on Popularity and Class in Named Data Network. Proceedings of the 2018 International Conference on Control, Electronics, Renewable Energy and Communications (ICCEREC), Bali, Indonesia.","DOI":"10.1109\/ICCEREC.2018.8712105"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1473","DOI":"10.1109\/COMST.2015.2420097","article-title":"A survey of caching mechanisms in information-centric networking","volume":"17","author":"Zhang","year":"2015","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Fricker, C., Robert, P., Roberts, J., and Sbihi, N. (2012, January 25\u201330). Impact of traffic mix on caching performance in a content-centric network. Proceedings of the IEEE INFOCOM Workshops, Orlando, FL, USA.","DOI":"10.1109\/INFCOMW.2012.6193511"},{"key":"ref_23","unstructured":"Pentikousis, K., Ohlman, B., Davies, E., Spirou, S., and Boggia, G. (2020, December 09). Information-Centric Networking: Evaluation and Security Considerations. Available online: https:\/\/tools.ietf.org\/html\/draft-irtf-icnrg-evaluation-methodology-05."},{"key":"ref_24","unstructured":"Che, H., Wang, Z., and Tung, Y. (2001, January 22\u201326). Analysis and design of hierarchical Web Caching System. Proceedings of the IEEE INFOCOM 2001, Anchorage, AK, USA."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Koplenig, A. (2015). Using the parameters of the Zipf-Mandelbrot law to measure diachronic lexical, syntactical and stylistic changes\u2014A large-scale corpus analysis. Corpus Linguist. Linguist. Theory, 14.","DOI":"10.1515\/cllt-2014-0049"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"1447","DOI":"10.1109\/TNET.2008.918081","article-title":"Traffic Modeling and Proportional Partial Caching for Peer-to-Peer Systems","volume":"16","author":"Hefeeda","year":"2008","journal-title":"IEEE\/ACM Trans. Netw."}],"container-title":["Future Internet"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-5903\/12\/12\/227\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T10:42:51Z","timestamp":1760179371000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-5903\/12\/12\/227"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,9]]},"references-count":26,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2020,12]]}},"alternative-id":["fi12120227"],"URL":"https:\/\/doi.org\/10.3390\/fi12120227","relation":{},"ISSN":["1999-5903"],"issn-type":[{"type":"electronic","value":"1999-5903"}],"subject":[],"published":{"date-parts":[[2020,12,9]]}}}