Optimal cooperative routing protocol based on prefix popularity for Content Centric Networking

Tarnoi, Saran; Kumwilaisak, Wuttipong; Ji, Yusheng

doi:10.1109/lcn.2014.6925805

Cited by 3 publications

(3 citation statements)

References 5 publications

(7 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…V is the normalized information value of the th q prefix group, and D represents the number of content chunks per prefix. Note that prefix group refers to the group of different data packets that have the associated prefixes [18,19]. According to the end-to-end delay for real-time communication [20],  is set to 250 millisecond to ensure that the requester will perceive content with acceptable quality on time.…”

Section: ) (T N Immentioning

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: ) (T N Immentioning

confidence: 99%

“…-Optimal cooperative routing protocol (OCRP) is selectively multiple flows of interests into the same path and calculates the optimal path using binary linear optimization [19]. The experimental notation description of different caching algorithms is described in Table 2.…”

Section: Performance Evaluationmentioning

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

“…As the paper presents a new caching algorithm, we compare the proposed caching algorithm with previous caching schemes and use the new caching algorithm with three different transmission schemes. Transmission schemes used in the performance evaluation consist of Shortest Path Routing (SP) , Cooperative Routing Protocol (CP) , and Optimal Cooperative Routing Protocol (OCRP) . Shortest Path Routing finds the shortest path by which to send an interest packet, and the corresponding data packet is sent back to the requester on the same path as the interest packet.…”

Section: Performance Evaluationmentioning

confidence: 99%

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

On Caching and Routing in Information-Centric Networks

Seetharam

2018

IEEE Commun. Mag.

View full text Add to dashboard Cite

Optimal cooperative routing protocol based on prefix popularity for Content Centric Networking

Cited by 3 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

On Caching and Routing in Information-Centric Networks

Contact Info

Product

Resources

About