Advanced International Journal for Research

E-ISSN: 3048-7641   •   Impact Factor: 9.11

A Widely Indexed Open Access Peer Reviewed Multidisciplinary Bi-monthly Scholarly International Journal

Call for Paper Volume 7, Issue 4 (July-August 2026) Submit your research before last 3 days of August to publish your research paper in the issue of July-August.
Submit Research Paper Join as a Reviewer

Plagiarism is checked by the leading plagiarism checker TurnItIn

Call for Paper

Volume 7 Issue 4
July-August 2026

Submit your research paper

Indexing Partners
Academia Advanced Sciences Index Bielefeld Academic Search Engine CiteSeer DRJI Google Scholar Independent Search Engine & Directory Network ISI (International Scientific Indexing) Issuu Mendeley Research Networks
RefSeek ResearcherId - Thomson Reuters ResearchGate Scirus Scribd Semantic Scholar Wiki for Call for Papers WorldCat Zenodo

A Hybrid Cache Replacement Strategy for Named Data Networking Using Online, Approximate, and Interval based Policy Iteration with PIT-Based Eviction

Author(s) Mr. Sushil Kumar Bagi, Prof. Dr. neeraj kumar
Country India
Abstract Named Data Network is a new architecture for future network. It is based on the importance of data sharing concept without using location based IP-Address. Caching is the technique to improve the performance of NDN. However the cache replacement in this technology is the decision making process. When memory become full then cache replacement techniques are used to take the decision in order to find which data item should be evicted from memory so that new arrival of data can be inserted. The purpose of this paper to enhance the NDN performance by develop the new cache replacement technique based on an online approximate policy iteration framework which enabled lightweight decision making named Policy Iteration Cache Replacement (PI-CREPL) which is hybrid approach of policy iteration and pending interest table based cache replacement technique i.e. PIT-REPL. Where PIT-REPL is cache replacement strategy that is based on pending interest table. Unlike classical Policy Iteration, the proposed approach (PI-CREPL) performs online and interval-based policy updates without requiring convergence of the value function, enabling adaptive cache replacement under dynamic traffic conditions. This PI-CREPL is used to make the optimal decision for eviction based on two concepts, one is the dynamic programming of MDP and second one is popularity of data Pending Interest Table for eviction. Simulation results show that PI-CREPL outperforms with, Priority FIFO, LRU and PIT-REPL methods in terms of cache hit ratio and latency across both tree and linear topologies.
Keywords NDN, Cache Replacement, Interest Packet, MDP, Data Packet, Policy Iteration
Field Engineering
Published In Volume 7, Issue 4, July-August 2026
Published On 2026-07-08
View / Download PDF File

Share this



E-ISSN 3048-7641
CrossRef

CrossRef DOI is assigned to each research paper published in our journal.

AIJFR DOI prefix is
10.63363/aijfr

Downloads
Research Paper Format Copyright Permission Form and Undertaking Form Cover Page Vol 7 Isu 4Cover Page Vol 7 Isu 3Cover Page Vol 7 Isu 2

All research papers published on this website are licensed under Creative Commons Attribution-ShareAlike 4.0 International License, and all rights belong to their respective authors/researchers.

CC-BY-SA Open Access

About AIJFR
Fees & Payment
Current Issue
Publication Archive 		Submit Research Paper
Track Submission Status
Publication Guidelines
Publication Ethics
Peer Review & Plagiarism 		Join as a Reviewer
Editors & Reviewers
Reviewer Referral Program
Get Reviewer Membership Certi. 		Website/Journal Policies
Usage Policy
Content Policies
Privacy Policy
Contact Us +91-9898-79-39-59 editor@aijfr.com