Dynamic Probabilistic Caching Algorithm with Content Priorities for Content‐Centric Networks

Dynamic Probabilistic Caching Algorithm with Content Priorities for Content‐Centric Networks

This paper presents a caching algorithm that offers better reconstructed data quality to the requesters than a probabilistic caching scheme while maintaining comparable network performance. It decides whether an incoming data packet must be cached based on the dynamic caching probability, which is a...

Full description

Bibliographic Details
Main Authors: Warit Sirichotedumrong, Wuttipong Kumwilaisak, Saran Tarnoi, Nattanun Thatphitthukkul
Format: Article
Language:English
Published: Electronics and Telecommunications Research Institute (ETRI) 2017-10-01
Series:ETRI Journal
Subjects:
Addition factor adaptation
Caching algorithm
Content‐centric network
Content popularity
Data priority
Multiplication factor adaptation
Online Access:https://doi.org/10.4218/etrij.17.0117.0117

Internet

https://doi.org/10.4218/etrij.17.0117.0117

Similar Items