Open AccessDynamic Probabilistic Caching Algorithm with Content Priorities for Content‐Centric Networks
Author(s) -
Sirichotedumrong Warit,
Kumwilaisak Wuttipong,
Tarnoi Saran,
Thatphitthukkul Nattanun
Publication year - 2017
Publication title -
etri journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.295
H-Index - 46
eISSN - 2233-7326
pISSN - 1225-6463
DOI - 10.4218/etrij.17.0117.0117
Subject(s) - cache , computer science , router , probabilistic logic , network packet , adaptation (eye) , factor (programming language) , multiplication (music) , cache algorithms , computer network , scheme (mathematics) , algorithm , distributed computing , cpu cache , artificial intelligence , physics , acoustics , optics , programming language , mathematical analysis , mathematics
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 adjusted according to the priorities of content carried by the data packet, the uncertainty of content popularities, and the records of cache events in the router. The adaptation of caching probability depends on the priorities of content, the multiplication factor adaptation, and the addition factor adaptation. The multiplication factor adaptation is computed from an instantaneous cache‐hit ratio, whereas the addition factor adaptation relies on a multiplication factor, popularities of requested contents, a cache‐hit ratio, and a cache‐miss ratio. We evaluate the performance of the caching algorithm by comparing it with previous caching schemes in network simulation. The simulation results indicate that our proposed caching algorithm surpasses previous schemes in terms of data quality and is comparable in terms of network performance.