CPePC: Cooperative Caching for Named Data Networks
Published:Dec 30, 2025 08:35
•1 min read
•ArXiv
Analysis
This paper addresses the challenge of efficient caching in Named Data Networks (NDNs) by proposing CPePC, a cooperative caching technique. The core contribution lies in minimizing popularity estimation overhead and predicting caching parameters. The paper's significance stems from its potential to improve network performance by optimizing content caching decisions, especially in resource-constrained environments.
Key Takeaways
- •CPePC is a cooperative caching technique for Named Data Networks.
- •It minimizes popularity estimation overhead through community-based coordination.
- •It predicts caching parameters based on cache occupancy and content popularity.
- •The paper presents algorithms for community detection, leader selection, content popularity estimation, and caching decisions.
- •Simulation results show CPePC outperforms other state-of-the-art caching techniques.
Reference
“CPePC bases its caching decisions by predicting a parameter whose value is estimated using current cache occupancy and the popularity of the content into account.”