A Latency-Aware and Resource-Efficient Content Caching Scheme for Content-Centric Networks

The proliferation of smart devices and bandwidth-intensive applications challenges traditional IP networks, driving interest in Content-Centric Networking (CCN). CCN decouples content from location using persistent names and leverages in-network caching to improve delivery efficiency. However, existing caching strategies often optimize isolated metrics like hit ratio, leading to suboptimal performance in latency or resource usage, employ inefficient eviction policies like Least Recently Used (LRU)/Least Frequently Used (LFU) unsuitable for dynamic content, or create excessive redundancy. They struggle to balance conflicting factors such as content popularity, freshness, latency, diversity, and resource constraints. To address this, we propose Latency-Aware and Resource-efficient Content-caching (LARC), a multi-objective heuristic approach that effectively improves latency performance while balancing resource constraints. LARC utilizes a lightweight, self-tuning heuristic featuring a Content Access Score (CAS) that dynamically integrates request frequency, content freshness (via adaptive decay), and hop distance. This score guides both an adaptive cache placement strategy, sensitive to real-time network conditions, and a novel freshness-aware eviction mechanism. By enhancing latency performance while considering resource efficiency, LARC implicitly enhances hit ratio, content freshness, and diversity. Extensive simulations on large-scale topologies showed that LARC achieves up to 9% improvement in hit ratio, up to 3% reduction in average latency, up to 3% enhancement in path-stretch, and up to 4% improvement in link-load compared to the state-of-the-art caching schemes.

Authors

Institutions

Publication Details

Journal
IEEE Access
Published
2025-01-01
DOI
https://doi.org/10.1109/access.2025.3596376
Citations
2
Primary Topic
Caching and Content Delivery
Type
article
Field-Weighted Citation Impact
2.97
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Latency-Aware and Resource-Efficient Content Caching Scheme for Content-Centric Networks

Rao Naveed Bin Rais, Imran Ali Khan, Osman Khalid, Yasar Khan
2 citations
IEEE Access
Caching and Content Delivery
2.97
article

A Latency-Aware and Resource-Efficient Content Caching Scheme for Content-Centric Networks

Rao Naveed Bin Rais, Imran Ali Khan, Osman Khalid, Yasar Khan
article en
2 citations

Abstract

The proliferation of smart devices and bandwidth-intensive applications challenges traditional IP networks, driving interest in Content-Centric Networking (CCN). CCN decouples content from location using persistent names and leverages in-network caching to improve delivery efficiency. However, existing caching strategies often optimize isolated metrics like hit ratio, leading to suboptimal performance in latency or resource usage, employ inefficient eviction policies like Least Recently Used (LRU)/Least Frequently Used (LFU) unsuitable for dynamic content, or create excessive redundancy. They struggle to balance conflicting factors such as content popularity, freshness, latency, diversity, and resource constraints. To address this, we propose Latency-Aware and Resource-efficient Content-caching (LARC), a multi-objective heuristic approach that effectively improves latency performance while balancing resource constraints. LARC utilizes a lightweight, self-tuning heuristic featuring a Content Access Score (CAS) that dynamically integrates request frequency, content freshness (via adaptive decay), and hop distance. This score guides both an adaptive cache placement strategy, sensitive to real-time network conditions, and a novel freshness-aware eviction mechanism. By enhancing latency performance while considering resource efficiency, LARC implicitly enhances hit ratio, content freshness, and diversity. Extensive simulations on large-scale topologies showed that LARC achieves up to 9% improvement in hit ratio, up to 3% reduction in average latency, up to 3% enhancement in path-stretch, and up to 4% improvement in link-load compared to the state-of-the-art caching schemes.

IEEE AccessVol. 13
COMSATS University Islamabad (PK), Ajman University (AE), City University Ajman (AE), Abbottabad University of Science and Technology (PK)
Openalex Percentile: Top 8%
Caching and Content Delivery
2.97
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.