Performance analysis of probabilistic caching scheme using Markov chains

Conference proceedings article

Authors/Editors

Strategic Research Themes

No matching items found.

Publication Details

Author list: Tarnoi S., Suppakitpaisarn V., Kumwilaisak W., Ji Y.

Publisher: Hindawi

Publication year: 2015

Volume number: 26-29-October-2015

Start page: 46

End page: 54

Number of pages: 9

ISBN: 9781467367707

ISSN: 0146-9428

eISSN: 1745-4557

URL: https://www.scopus.com/inward/record.uri?eid=2-s2.0-84973866679&doi=10.1109%2fLCN.2015.7366282&partnerID=40&md5=8640caee8fa975cce2c019a9135aa8d2

Languages: English-Great Britain (EN-GB)

View on publisher site

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. ฉ 2015 IEEE.

Keywords

Markov chain, probabilistic caching scheme