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...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Electronics and Telecommunications Research Institute (ETRI)
2017-10-01
|
| Series: | ETRI Journal |
| Subjects: | |
| Online Access: | https://doi.org/10.4218/etrij.17.0117.0117 |
| _version_ | 1811340293835849728 |
|---|---|
| author | Warit Sirichotedumrong Wuttipong Kumwilaisak Saran Tarnoi Nattanun Thatphitthukkul |
| author_facet | Warit Sirichotedumrong Wuttipong Kumwilaisak Saran Tarnoi Nattanun Thatphitthukkul |
| author_sort | Warit Sirichotedumrong |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-13T18:39:46Z |
| format | Article |
| id | doaj.art-662b3f2db145431eae0fc4e7cec74c90 |
| institution | Directory Open Access Journal |
| issn | 1225-6463 2233-7326 |
| language | English |
| last_indexed | 2024-04-13T18:39:46Z |
| publishDate | 2017-10-01 |
| publisher | Electronics and Telecommunications Research Institute (ETRI) |
| record_format | Article |
| series | ETRI Journal |
| spelling | doaj.art-662b3f2db145431eae0fc4e7cec74c902022-12-22T02:34:46ZengElectronics and Telecommunications Research Institute (ETRI)ETRI Journal1225-64632233-73262017-10-0139569570610.4218/etrij.17.0117.011710.4218/etrij.17.0117.0117Dynamic Probabilistic Caching Algorithm with Content Priorities for Content‐Centric NetworksWarit SirichotedumrongWuttipong KumwilaisakSaran TarnoiNattanun ThatphitthukkulThis 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.https://doi.org/10.4218/etrij.17.0117.0117Addition factor adaptationCaching algorithmContent‐centric networkContent popularityData priorityMultiplication factor adaptation |
| spellingShingle | Warit Sirichotedumrong Wuttipong Kumwilaisak Saran Tarnoi Nattanun Thatphitthukkul Dynamic Probabilistic Caching Algorithm with Content Priorities for Content‐Centric Networks ETRI Journal Addition factor adaptation Caching algorithm Content‐centric network Content popularity Data priority Multiplication factor adaptation |
| title | Dynamic Probabilistic Caching Algorithm with Content Priorities for Content‐Centric Networks |
| title_full | Dynamic Probabilistic Caching Algorithm with Content Priorities for Content‐Centric Networks |
| title_fullStr | Dynamic Probabilistic Caching Algorithm with Content Priorities for Content‐Centric Networks |
| title_full_unstemmed | Dynamic Probabilistic Caching Algorithm with Content Priorities for Content‐Centric Networks |
| title_short | Dynamic Probabilistic Caching Algorithm with Content Priorities for Content‐Centric Networks |
| title_sort | dynamic probabilistic caching algorithm with content priorities for content centric networks |
| topic | Addition factor adaptation Caching algorithm Content‐centric network Content popularity Data priority Multiplication factor adaptation |
| url | https://doi.org/10.4218/etrij.17.0117.0117 |
| work_keys_str_mv | AT waritsirichotedumrong dynamicprobabilisticcachingalgorithmwithcontentprioritiesforcontentcentricnetworks AT wuttipongkumwilaisak dynamicprobabilisticcachingalgorithmwithcontentprioritiesforcontentcentricnetworks AT sarantarnoi dynamicprobabilisticcachingalgorithmwithcontentprioritiesforcontentcentricnetworks AT nattanunthatphitthukkul dynamicprobabilisticcachingalgorithmwithcontentprioritiesforcontentcentricnetworks |