Document Type

Article

Publication Date

2024

DOI

10.1007/s11235-024-01140-7

Publication Title

Telecommunication Systems

Volume

86

Pages

585-596

Abstract

Named Data Network (NDN) is proposed for the Internet as an information-centric architecture. Content storing in the router’s cache plays a significant role in NDN. When a router’s 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’s 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.

Rights

© The Authors 2024.

This article is licensed under a Creative Commons Attribution 4.0 International (CC BY 4.0) License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.

Original Publication Citation

Hosseinzadeh, M., Moghim, N., Taheri, S., & Gholami, N. (2024). A new cache replacement policy in named data network based on FIB table information. Telecommunication Systems, 86, 585-596. https://doi.org/10.1007/s11235-024-01140-7

ORCID

0000-0002-6338-5505 (Moghim)

Download

Share

COinS