Prioritized Probabilistic Caching Algorithm in Content Centric Networks

Sirichotedumrong, Warit; Kumwilaisak, Wuttipong; Tarnoi, Saran; Thatphithakkul, Nattanun

doi:10.1007/978-3-319-40415-8_25

Cited by 4 publications

(7 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several caching schemes were proposed to be used in CCN [3][4][5][6][7][8][9][10][11][12]. Originally, CCN employs universal caching scheme (Always), which allows CS to cache every incoming data packet not existing in the CS.…”

Section: Introductionmentioning

confidence: 99%

“…By nature of data contents mainly multimedia, different portions of data possess different priorities from the compression process. However, the proposed algorithms in [3][4][5][6][7][8][9][10][11] did not consider various priorities and unequal importance of data packets while the prioritized probabilistic caching algorithm [12] cannot maintain the overall network performance yielded by Prob.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Adaptive Prioritized Probabilistic Caching Algorithm for Content Centric Networks

Sirichotedumrong¹,

Kumwilaisak²,

Tarnoi³

et al. 2017

Self Cite

View full text Add to dashboard Cite

Abstract. This paper presents an adaptive prioritized probabilistic caching algorithm (APP) for content centric networks (CCN). The objective of the new caching algorithm is to satisfy content requesters with both improving received data quality and maintaining overall network performance. APP allows CCN routers to cache data packets based on the caching probability which is prioritized and unequally handles incoming data packets according to data priorities. APP adjusts the caching probability based on cache events occurred at the CCN router, and the current caching probability is calculated from the previous caching probability. We evaluate APP performance via computer simulations and compare the performance of our caching algorithm with previous caching schemes. The performance evaluation metrics compose of the received data quality, cache-hit percentage, server load, and traffic load. The computer simulation results show that APP yields the better data quality to content requesters and nearly performs in-network caching as well as the previous probabilistic caching scheme.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Adaptive Prioritized Probabilistic Caching Algorithm for Content Centric Networks

Sirichotedumrong¹,

Kumwilaisak²,

Tarnoi³

et al. 2017

Self Cite

View full text Add to dashboard Cite

show abstract

“…Various caching schemes for CCN have been proposed in . A caching scheme that caches every incoming data packet was originally proposed as a universal caching scheme .…”

Section: Introductionmentioning

confidence: 99%

“…Caching schemes based on energy awareness were introduced in . Furthermore, there are several probabilistic caching schemes whose key idea is to let routers randomly cache incoming data packets. However, the previous caching schemes did not consider the unequal importance of the data packets.…”

Section: Introductionmentioning

confidence: 99%

“…However, the previous caching schemes did not consider the unequal importance of the data packets. Prioritized probabilistic caching for CCN was proposed in to handle the heterogeneous priorities of content, but it adjusted caching probability based on the accumulated content popularity. However, the proposed caching algorithm utilizes network events to identify content popularity and provides a mathematical model to calculate the factors associated with caching probability adaptation.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

Sirichotedumrong¹,

Kumwilaisak²,

Tarnoi³

et al. 2017

ETRI Journal

Self Cite

View full text Add to dashboard Cite

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.

show abstract

An In-Network Caching Scheme Based on Energy Efficiency for Content-Centric Networks

2018

IEEE Access

View full text Add to dashboard Cite

Prioritized Probabilistic Caching Algorithm in Content Centric Networks

Cited by 4 publications

References 5 publications

Adaptive Prioritized Probabilistic Caching Algorithm for Content Centric Networks

Adaptive Prioritized Probabilistic Caching Algorithm for Content Centric Networks

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

An In-Network Caching Scheme Based on Energy Efficiency for Content-Centric Networks

Contact Info

Product

Resources

About