MPC: Popularity-based caching strategy for content centric networks

Bernardini, César; Silverston, Thomas; Festor, Olivier

doi:10.1109/icc.2013.6655114

Cited by 189 publications

(95 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…As a result, a copy of a seldom requested information object may be cached in several nodes, at a high price of communication. Although caching based on popularity has been proposed [10], vehicular networks were not discussed.…”

Section: Problems Of Caching In Information-centric Networkmentioning

confidence: 99%

Implicit Cooperative Caching based on Information Popularity for Vehicular Networks

Lindgren

et al. 2017

Proceedings of the 12th Workshop on Challenged Networks

View full text Add to dashboard Cite

Information-centric networking (ICN) technology is becoming a popular research topic in vehicular networks due to the connectionless and lightweight characteristics of this networking paradigm. Caching plays an essential role in information-centric networks, but current caching techniques for ICN are not ideal for the dynamic and wireless vehicular networks. This paper presents a caching approach for ICN-based vehicular networks that takes into account both the dynamicity of vehicular networks and the popularity of the information being distributed. We introduce an interval metric for selective caching. With this metric and estimates of information popularity and vehicle density, cooperative caching can be realized without exchanging cache management information among the vehicular nodes. Simulation results show that the proposed approach can increase the storage space utilization and has low data response time for vehicular networks. CCS CONCEPTSNetworks →Network types →Ad hoc networks →Mobile ad hoc networks • Networks →Network services →In-network processing KEYWORDSCaching, vehicular networks, information-centric networking (ICN), information popularity, vehicle density

show abstract

Section: Problems Of Caching In Information-centric Networkmentioning

confidence: 99%

Implicit Cooperative Caching based on Information Popularity for Vehicular Networks

Lindgren

et al. 2017

Proceedings of the 12th Workshop on Challenged Networks

View full text Add to dashboard Cite

show abstract

“…Even if the cache size is not a major concern in VANETs, it is not obvious if this cache can keep up the pace with the increasing scale of multimedia content distribution over VANETs. For these reasons, it was proposed in [30,31] to cache only popular content (i.e. content which has been requested a number of time equal or larger than a fixed Popularity Threshold, PT).…”

Section: Sdn For Ccn Cachingmentioning

confidence: 99%

A Multi-Pronged Approach to Adaptive and Context Aware Content Dissemination in VANETs

et al. 2017

View full text Add to dashboard Cite

Content dissemination in Vehicular Ad-hoc Networks (VANETs) has the potential to enable a myr- iad of applications, ranging from advertising, traffic and emergency warnings to infotainment. This variety in applications and services calls for mechanisms able to optimize content storing, retrieval and forwarding among vehicles, without jeopardizing network resources. Content Centric Networking (CCN), takes advantage of inherent content redundancy in the network in order to decrease the utilization of network resources, improve response time and content availability, coping efficiently with some of the effects of mobility. Floating Content (FC), on the other hand, holds potential to implement efficiently a large amount of vehicular applications thanks to its property of geographic content replication, while Software Defined Networking (SDN), is an attractive solution for the lack of flexibility and dynamic programmability that characterizes current VANET architectures. By implementing a logical centralization of the network, SDN enables dynamic and efficient management of network resources.In this paper, for a few reference scenarios, we illustrate how approaches that combine CCN, FC and SDN enable an innovative adaptive VANET architecture able to efficiently accommodate to intermittent connectivity, fluctuating node density and mobility patterns on one side and application performance and network resources on the other side, aiming to achieve high QoS. For each scenario, we highlight the main open research challenges, and we describe possible solutions to improve content dissemination and reduce replication without affecting content availability.

show abstract

“…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%

“…Originally, CCN employs universal caching scheme (Always), which allows CS to cache every incoming data packet not existing in the CS. The popularity-based caching strategies were presented in [3] and [4], respectively. The probabilistic caching schemes (Prob) were proposed in [5][6][7][8][9][10][11] to randomly cache data packets based on probability.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Adaptive Prioritized Probabilistic Caching Algorithm for Content Centric Networks

Sirichotedumrong¹,

Kumwilaisak²,

Tarnoi³

et al. 2017

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

MPC: Popularity-based caching strategy for content centric networks

Cited by 189 publications

References 7 publications

Implicit Cooperative Caching based on Information Popularity for Vehicular Networks

Implicit Cooperative Caching based on Information Popularity for Vehicular Networks

A Multi-Pronged Approach to Adaptive and Context Aware Content Dissemination in VANETs

Adaptive Prioritized Probabilistic Caching Algorithm for Content Centric Networks

Contact Info

Product

Resources

About