{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:30:18Z","timestamp":1772119818398,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,4,16]],"date-time":"2024-04-16T00:00:00Z","timestamp":1713225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,4,16]],"date-time":"2024-04-16T00:00:00Z","timestamp":1713225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Telecommun Syst"],"published-print":{"date-parts":[[2024,7]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Named Data Network (NDN) is proposed for the Internet as an information-centric architecture. Content storing in the router\u2019s cache plays a significant role in NDN. When a router\u2019s cache becomes full, a cache replacement policy determines which content should be discarded for the new content storage. This paper proposes a new cache replacement policy called Discard of Fast Retrievable Content (DFRC). In DFRC, the retrieval time of the content is evaluated using the FIB table information, and the content with less retrieval time receives more discard priority. An impact weight is also used to involve both the grade of retrieval and stale parameters in the discard priority calculation. This weight adjusts the relative impact of these two parameters on the discard priority. The grade of retrieval reflects the content\u2019s retrieval time, and the stale parameter indicates its popularity. The reinforcement Learning method is used to calculate the suitable weight dynamically and based on the network condition. Simulation results show that DFRC improves hit rate and round-trip time compared to Least Recently Used, Optimized Cache Replacement algorithm for Information-Centric Networks, Efficient Popularity-aware Probabilistic Caching, and Shortest Round-Trip Time.<\/jats:p>","DOI":"10.1007\/s11235-024-01140-7","type":"journal-article","created":{"date-parts":[[2024,4,16]],"date-time":"2024-04-16T11:25:34Z","timestamp":1713266734000},"page":"585-596","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A new cache replacement policy in named data network based on FIB table information"],"prefix":"10.1007","volume":"86","author":[{"given":"Mehran","family":"Hosseinzadeh","sequence":"first","affiliation":[]},{"given":"Neda","family":"Moghim","sequence":"additional","affiliation":[]},{"given":"Samira","family":"Taheri","sequence":"additional","affiliation":[]},{"given":"Nasrin","family":"Gholami","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,16]]},"reference":[{"key":"1140_CR1","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.cosrev.2016.01.001","volume":"19","author":"XD Saxena","year":"2016","unstructured":"Saxena, X. D., et al. (2016). Named data networking: A survey. Computer Science Review, 19, 15\u201355.","journal-title":"Computer Science Review"},{"key":"1140_CR2","doi-asserted-by":"publisher","first-page":"126164","DOI":"10.1109\/ACCESS.2019.2938586","volume":"7","author":"K Yu","year":"2019","unstructured":"Yu, K., et al. (2019). Information-centric networking: Research and standardization status. IEEE Access, 7, 126164\u2013126176.","journal-title":"IEEE Access"},{"key":"1140_CR3","doi-asserted-by":"crossref","unstructured":"Sureshjani, M. H., & Moghim, N. (2018). Cache replacement policy \"Discard of Fast Retrievable Content\" in named data networking of things. In Proceedings of the international conference on smart cities and internet of things.","DOI":"10.1145\/3269961.3269970"},{"key":"1140_CR4","doi-asserted-by":"crossref","unstructured":"Tarnoi, S., Suksomboon, K., Kumwilaisak, W., & Ji, Y. (2014). Performance of probabilistic caching and cache replacement policies for content-centric networks. In 39th Annual IEEE Conference on Local Computer Networks.","DOI":"10.1109\/LCN.2014.6925761"},{"key":"1140_CR5","doi-asserted-by":"crossref","unstructured":"Jia, Z., Zhang, P., Huang, J., Lin, C., & Lui, J. C. (2013). Modeling hierarchical caches in content-centric networks. In 22nd International Conference on Computer Communication and Networks (ICCCN). IEEE.","DOI":"10.1109\/ICCCN.2013.6614153"},{"key":"1140_CR6","doi-asserted-by":"crossref","unstructured":"Yokota, K., Sugiyama, K., Kurihara, J., & Tagami, A. (2016). RTT-based caching policies to improve user-centric performance in CCN. In IEEE 30th International Conference on Advanced Information Networking and Applications (AINA).","DOI":"10.1109\/AINA.2016.32"},{"issue":"10","key":"1140_CR7","doi-asserted-by":"publisher","first-page":"7140","DOI":"10.1109\/JIOT.2021.3075317","volume":"9","author":"MA Naeem","year":"2021","unstructured":"Naeem, M. A., Nguyen, T. N., Ali, R., Cengiz, K., Meng, Y., & Khurshaid, T. (2021). Hybrid cache management in IoT-based named data networking. IEEE Internet of Things Journal, 9(10), 7140\u20137150.","journal-title":"IEEE Internet of Things Journal"},{"key":"1140_CR8","doi-asserted-by":"crossref","unstructured":"Sun, X., & Wang, Z. (2015). An optimized cache replacement algorithm for information-centric networks. In IEEE International Conference on Smart City\/SocialCom\/SustainCom (SmartCity).","DOI":"10.1109\/SmartCity.2015.148"},{"key":"1140_CR9","first-page":"100419","volume":"28","author":"VP Singh","year":"2020","unstructured":"Singh, V. P., & Ujjwal, R. L. (2020). A walkthrough of name data networking: architecture, functionalities, operations, and open issues. Sustainable Computing: Informatics and Systems, 28, 100419.","journal-title":"Sustainable Computing: Informatics and Systems"},{"issue":"3","key":"1140_CR10","doi-asserted-by":"publisher","first-page":"85","DOI":"10.3390\/info10030085","volume":"10","author":"M Al-qutwani","year":"2019","unstructured":"Al-qutwani, M., Xingwei, W., & Bo, Y. (2019). Name lookup in named data networking: A review. Information, 10(3), 85.","journal-title":"Information"},{"issue":"2","key":"1140_CR11","doi-asserted-by":"publisher","first-page":"1443","DOI":"10.1109\/COMST.2017.2787609","volume":"20","author":"U Din","year":"2018","unstructured":"Din, U., Hassan, S., Khan, M. K., Guizani, M., Ghazali, O., & Habbal, A. (2018). Caching in information-centric networking: Strategies, challenges, and future research directions. IEEE Communications Surveys & Tutorials, 20(2), 1443\u20131474.","journal-title":"IEEE Communications Surveys & Tutorials"},{"key":"1140_CR12","doi-asserted-by":"crossref","unstructured":"Eum, S., Nakauchi, K., Murata, M., Shoji, Y., & Nishinaga, N. (2012). CATT: Potential based routing with content caching for ICN. In Proceedings of the second edition of the ICN workshop on Information-centric networking.","DOI":"10.1145\/2342488.2342500"},{"issue":"7","key":"1140_CR13","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1016\/j.comcom.2013.01.007","volume":"36","author":"WK Chai","year":"2013","unstructured":"Chai, W. K., et al. (2013). Cache \u201cless for more\u201d in information-centric networks (extended version). Computer Communications, 36(7), 758\u2013770.","journal-title":"Computer Communications"},{"key":"1140_CR14","doi-asserted-by":"crossref","unstructured":"Chen, C., Jiang, J., Fu, R., Chen, L., Li, C., & Wan, S. (2021). An intelligent caching strategy considering time-space characteristics in vehicular named data networks. In IEEE Transactions on Intelligent Transportation Systems.","DOI":"10.1109\/TITS.2021.3128012"},{"key":"1140_CR15","doi-asserted-by":"publisher","first-page":"107625","DOI":"10.1016\/j.comnet.2020.107625","volume":"184","author":"M Amadeo","year":"2021","unstructured":"Amadeo, M., Ruggeri, G., Campolo, C., & Molinaro, A. (2021). Diversity-improved caching of popular transient contents in Vehicular Named Data Networking. Computer Networks, 184, 107625.","journal-title":"Computer Networks"},{"issue":"3","key":"1140_CR16","doi-asserted-by":"publisher","first-page":"1473","DOI":"10.1109\/COMST.2015.2420097","volume":"17","author":"M Zhang","year":"2015","unstructured":"Zhang, M., Luo, H., & Zhang, H. (2015). A survey of caching mechanisms in information-centric networking. IEEE Communications Surveys & Tutorials, 17(3), 1473\u20131499.","journal-title":"IEEE Communications Surveys & Tutorials"},{"key":"1140_CR17","doi-asserted-by":"crossref","unstructured":"Katsaros, K., Xylomenos, G., & Polyzos, G. C. (2010). A hybrid overlay multicast and caching scheme for information-centric networking. In INFOCOM IEEE Conference on Computer Communications Workshops.","DOI":"10.1109\/INFCOMW.2010.5466659"},{"issue":"4","key":"1140_CR18","doi-asserted-by":"publisher","first-page":"936","DOI":"10.1016\/j.comnet.2010.12.012","volume":"55","author":"K Katsaros","year":"2011","unstructured":"Katsaros, K., Xylomenos, G., & Polyzos, G. C. (2011). MultiCache: An overlay architecture for information-centric networking. Computer Networks, 55(4), 936\u2013947.","journal-title":"Computer Networks"},{"issue":"4","key":"1140_CR19","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1109\/MC.2004.1297303","volume":"37","author":"N Megiddo","year":"2004","unstructured":"Megiddo, N., & Modha, D. S. (2004). Outperforming LRU with an adaptive replacement cache algorithm. Computer, 37(4), 58\u201365.","journal-title":"Computer"},{"key":"1140_CR20","doi-asserted-by":"crossref","unstructured":"Li, Y., Yu, M., & Li, R. (2018). A cache replacement strategy based on hierarchical popularity in NDN. In Tenth International Conference on Ubiquitous and Future Networks (ICUFN).","DOI":"10.1109\/ICUFN.2018.8436597"},{"key":"1140_CR21","doi-asserted-by":"crossref","unstructured":"Ming, Z., Xu, M., & Wang, D. (2014). Age-based cooperative caching in information-centric networking. In 23rd International Conference on Computer Communication and Networks (ICCCN).","DOI":"10.1109\/ICCCN.2014.6911725"},{"key":"1140_CR22","doi-asserted-by":"crossref","unstructured":"Khelifi, H., Luo, S., Nour, B., & Moungla, H. (2019). A QoS-aware cache replacement policy for vehicular named data networks. In\u00a02019 IEEE Global Communications Conference (GLOBECOM) (pp. 1\u20136).","DOI":"10.1109\/GLOBECOM38437.2019.9013461"},{"issue":"52","key":"1140_CR23","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.pmcj.2018.12.002","volume":"2019","author":"M Meddeb","year":"2019","unstructured":"Meddeb, M., Dhraief, A., Belghith, A., Monteil, T., Drira, K., & Mathkour, H. (2019). Least fresh first cache replacement policy for NDN-based IoT networks. Pervasive and Mobile Computing, 2019(52), 60\u201370.","journal-title":"Pervasive and Mobile Computing"},{"key":"1140_CR24","doi-asserted-by":"crossref","unstructured":"Sureshjani, M., & Moghim. N. (2018). Cache replacement policy \u201cDiscard of Fast Retrievable Content\u201d in named data networking of things. In\u00a0Proceedings of the international conference on smart cities and internet of things (pp. 1\u20135).","DOI":"10.1145\/3269961.3269970"},{"key":"1140_CR25","unstructured":"Coggan, M. (2004). Exploration and exploitation in reinforcement learning. School Comput. Sci., McGill Univ., Montreal, QC, Canada, Tech. Rep. 1."},{"key":"1140_CR26","unstructured":"Koenig, S., & Simmons, R. G. (1993). Complexity analysis of real-time reinforcement learning. In AAAI (Vol. 93, pp. 99\u2013105)."},{"issue":"4","key":"1140_CR27","first-page":"217","volume":"3","author":"N Mehran","year":"2016","unstructured":"Mehran, N., & Movahhedinia, N. (2016). Randomized svd-based probabilistic caching strategy in named data networks. Journal of Computing and Security, 3(4), 217\u2013231.","journal-title":"Journal of Computing and Security"},{"issue":"1","key":"1140_CR28","doi-asserted-by":"publisher","first-page":"275","DOI":"10.7153\/jmi-2019-13-20","volume":"9","author":"J Jaksetic","year":"2019","unstructured":"Jaksetic, J., Pecaric, D., & Pecaric, J. (2019). Hybrid Zipf\u2013Mandelbrot law. Journal of Mathematical Inequalities, 9(1), 275\u2013286.","journal-title":"Journal of Mathematical Inequalities"}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-024-01140-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11235-024-01140-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-024-01140-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,20]],"date-time":"2024-07-20T00:24:42Z","timestamp":1721435082000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11235-024-01140-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,16]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["1140"],"URL":"https:\/\/doi.org\/10.1007\/s11235-024-01140-7","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-3315015\/v1","asserted-by":"object"}]},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"value":"1018-4864","type":"print"},{"value":"1572-9451","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,16]]},"assertion":[{"value":"17 March 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}