Performances of Probabilistic Caching Strategies in Content Centric Networking

Naeem, Muhammad Ali; Nor, Shahrudin Awang; Hassan, Suhaidi; Kim, Byung-Seo

doi:10.1109/access.2018.2872614

Cited by 23 publications

(23 citation statements)

References 65 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Cache Weight = y x (8) ProbCache = TimesIn + CacheWeight (9) where N n represents the total cache capacity along the data routing path, N x shows the average cache capacity of the total data routing path, Ttw indicates the target time window (for how long a content can be cached at a point), and n represents the number of routers along the path from the provider to the consumer. While calculating the CacheWeight factor, x and y represent the values of time since inception (TSI) and time since birth (TSB), respectively.…”

Section: Related Studymentioning

confidence: 99%

“…However, it is difficult to decide which content needs to be cached at which location to produce effective and efficient results. Therefore, several cache management strategies [18,[46][47][48] have been developed. Still, it is not clear which caching mechanism is the most ideal for each situation.…”

Section: The Problem Descriptionmentioning

confidence: 99%

“…To evaluate the proposed content caching mechanism CPCCS, it is necessary to compare its attributes with analogous ones in earlier mechanisms [18,42,47]. Therefore, we selected the SocialCCNSim-Master simulator [59] as the simulation environment for the performance comparison.…”

Section: Performance Evaluationmentioning

confidence: 99%

“…Therefore, requirements are increasing for user generated content (UGC) [5] and high-definition video on demand (VoD) traffic [6,7]. In fact, the Internet faced several challenges related to data volume and network traffic, which were caused by the huge consumer requirements for controlling media-driven data content [8].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Compound Popular Content Caching Strategy in Named Data Networking

et al. 2019

View full text Add to dashboard Cite

The aim of named data networking (NDN) is to develop an efficient data dissemination approach by implementing a cache module within the network. Caching is one of the most prominent modules of NDN that significantly enhances the Internet architecture. NDN-cache can reduce the expected flood of global data traffic by providing cache storage at intermediate nodes for transmitted contents, making data broadcasting in efficient way. It also reduces the content delivery time by caching popular content close to consumers. In this study, a new content caching mechanism named the compound popular content caching strategy (CPCCS) is proposed for efficient content dissemination and its performance is measured in terms of cache hit ratio, content diversity, and stretch. The CPCCS is extensively and comparatively studied with other NDN-based caching strategies, such as max-gain in-network caching (MAGIC), WAVE popularity-based caching strategy, hop-based probabilistic caching (HPC), LeafPopDown, most popular cache (MPC), cache capacity aware caching (CCAC), and ProbCache through simulations. The results shows that the CPCCS performs better in terms of the cache hit ratio, content diversity ratio, and stretch ratio than all other strategies.

show abstract

Section: Related Studymentioning

confidence: 99%

Section: The Problem Descriptionmentioning

confidence: 99%

Section: Performance Evaluationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Compound Popular Content Caching Strategy in Named Data Networking

et al. 2019

View full text Add to dashboard Cite

show abstract

“…When content consumer relocates to a new domain or access point, it has the ability to send pending Interest packets that are not satisfied with relevant data. The caching capability of NDN suppressed 3851 the problem of consumer mobility by supplementing of cached data to support node mobility [8,9]. However, many challenges aroused especially for the support of content producer [10,11], due to the consumer-driven nature of NDN architecture.…”

Section: Introductionmentioning

confidence: 99%

Analytical modelling solution of producer mobility support scheme for named data networking

Hussaini¹,

Nor²,

Ahmad³

2019

IJECE

Self Cite

View full text Add to dashboard Cite

Named Data Networking (NDN) is a clean-slate future Internet architecture proposed to support content mobility. However, content producer mobility is not supported fundamentally and faces many challenges such as, high handoff latency, signaling overhead cost and unnecessary Interest packet losses. Hence, many approaches indirection-based approach, mapping-based approach, locator-based approach and control/data plane-based approach were proposed to address these problems. Mapping-based and control/data plane-based approach deployed servers for name resolution serveces to provide optimal data path after handoff, but introduces high handoff latency and signalling overhead cost. Indirection-based and locator-based approach schemes provide normal handoff delay, but introduces sub-optimal or tiangular routing path. Therefore, there is needs to provide substantial producer mobility support that minimizes the handoff latency, signaling cost and improve data packets delivery via optimal path once a content producer relocates to new location. This paper proposed a scheme that provides optimal data path using mobility Interest packets and broadcasting strategy. Analytical investigation result shows that our proposed scheme outperforms existing approaches in terms of handoff latency, signaling cost and path optimization.

show abstract