DocumentCode :
3719134
Title :
Performance analysis of probabilistic caching scheme using Markov chains
Author :
Saran Tarnoi;Vorapong Suppakitpaisarn;Wuttipong Kumwilaisak;Yusheng Ji
Author_Institution :
Department of Informatics, SOKENDAI (The Graduate University for Advanced Studies), Tokyo, Japan
fYear :
2015
Firstpage :
46
Lastpage :
54
Abstract :
This paper presents a new analytical model to analyze the performance of a probabilistic caching scheme with various cache replacement policies in content-centric networks. The cache replacement policies include Random Replacement (RR), First In First Out (FIFO), and Least Recently Used (LRU). This analytical model is based on Markov chains under Independent Reference Model (IRM) and Zero Download Delay (ZDD) assumption. A closed-form expression of the stationary distribution of cache state is derived and is used to compute the hit rates of caching systems. Moreover, we use this model to establish several important properties of the probabilistic caching scheme as well as the guidelines on effectively using it. Results of computer simulations show that the proposed analytical solution can model the probabilistic caching scheme very accurately.
Keywords :
"Probabilistic logic","Markov processes","Analytical models","Computational modeling","Delays","Servers","Performance analysis"
Publisher :
ieee
Conference_Titel :
Local Computer Networks (LCN), 2015 IEEE 40th Conference on
Type :
conf
DOI :
10.1109/LCN.2015.7366282
Filename :
7366282
Link To Document :
بازگشت