Jul 2026· International Conference on Computer Communications and Networks· pp. 1-9· 0 citations· 26 references
Abstract
The built-in caching capability of Named Data Networking (NDN) is one of the most transformative proposals of next-generation network architecture, as it simultaneously realizes network traffic reduction, resilience to node failures, and prompt data retrieval. However, existing caching policies either make too many caches across the network by naively copying content everywhere or incur excess communication overhead for efficient caching through cache state exchange. Hence, we propose a machine learning-based caching policy along with a communication-efficient method to share the cache state. As the intelligent caching policy is capable of learning request patterns and estimating cache states of other nodes, our proposal realizes a more efficient utilization of the cache capacity by virtually considering the cache spaces of neighboring NDN nodes as an aggregated, larger cache space. The extensive evaluation experiments demonstrate the effectiveness of our proposal in increasing the cache hit ratio and reducing the average distance that each data travels to reach a requesting user. The effectiveness of the proposed cache state sharing method is empirically verified through an interpretable machine learning technique.
The rapid growth of internet users has significantly increased data traffic, demanding efficient content distribution architectures. Named Data Networking (NDN), an implementation of Information-Centric Networking (ICN), addresses this through in-network caching at router nodes. However, existing NDN caching strategies...
Muhammad Farhan, L. V. Yovita, Istikmal· International Seminar on Int...· 0 citations
This paper proposes a dynamic cache replacement strategy, PIT-DCREPL, based on parameters of the PIT table, and a selective caching technique, PIT–FIB–aware selective cache, which integrates PIT metadata and FIB forwarding information to enhance the CHR ( cache hit ratio) by adding a selective cache that prioritizes co...
S. Bagi, Neeraj Kumar· International Journal of Com...· 0 citations
Coded caching under various heterogeneous settings has been intensively studied. Specifically, in a shared-link model, a coded caching scheme based on a popularity-first caching strategy has been proved to be order-optimal under arbitrary popularity distributions. It is of great interest to investigate whether a simila...
Jin-Bei Zhang, Wenjie Guan, Kai Huang et al.· IEEE Transactions on Communi...· 0 citations
This paper introduces Trust-Weighted Proactive Caching (TWPC), a protocol designed to stop malicious content from ever reaching the Content Store by embedding dynamic trust evaluation directly into the packet forwarding pipeline.
Khelifa Kezrane, Kaddour Messaoudi, N. Lagraa· International journal of com...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.