Skip to Main content Skip to Navigation
Conference papers

A Markov Chain-based Approximation of CCN Caching Systems

Hamza Ammar 1 Soraya Chellouche 1 Yassine Hadjadj-Aoul 1
1 DIONYSOS - Dependability Interoperability and perfOrmance aNalYsiS Of networkS
Inria Rennes – Bretagne Atlantique , IRISA-D2 - RÉSEAUX, TÉLÉCOMMUNICATION ET SERVICES
Abstract : To address the challenges raised by the Internet usage evolution over the last years, the Content-Centric Networking (CCN) has been proposed. One key feature provided by CCN to improve the efficiency of content delivery is the in-network caching, which has major impact on the system performance. In order to improve caching effectiveness in such systems, studying the functioning of CCN in-network storage is required. In this paper, we propose MACS, a Markov chain-based Approximation of CCN caching Systems. We start initially by modeling a single cache node. Afterwards, we extend our model to the case of multiple nodes. A closed-form expression is then derived to define the cache hit probability of each content in the caching system. We compared the results of MACS to those obtained with simulations. The conducted experiments show clearly the accuracy of our model in estimating the cache hit performance of the system.
Document type :
Conference papers
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/hal-01657679
Contributor : Yassine Hadjadj Aoul <>
Submitted on : Thursday, December 7, 2017 - 8:50:50 AM
Last modification on : Thursday, February 25, 2021 - 5:30:04 PM

File

cache_hit_markov.pdf
Files produced by the author(s)

Identifiers

Citation

Hamza Ammar, Soraya Chellouche, Yassine Hadjadj-Aoul. A Markov Chain-based Approximation of CCN Caching Systems. ISCC 2017 - IEEE Symposium on Computers and Communications, Jul 2017, Heraklion, Greece. pp.1-6, ⟨10.1109/ISCC.2017.8024551⟩. ⟨hal-01657679⟩

Share

Metrics

Record views

457

Files downloads

346