Estimating Instantaneous Cache Hit Ratio Using Markov Chain Analysis

Gomaa, Hazem; Messier, Geoffrey G.; Williamson, Carey; Davies, Robert J.

doi:10.1109/tnet.2012.2227338

Cited by 40 publications

(31 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Consequently, the fluid limit of fault probability in the transient state as well as in the steady state is derived. Since the cache may not reach the steady‐state hit ratio when the number of Web contents, content popularity, and cache resources is subject to change, an analytical model for estimating the instantaneous hit ratio was proposed in Gomaa et al…”

Section: Related Workmentioning

confidence: 99%

“…24 There are many papers evaluating the performance of cache replacement policies. [25][26][27][28][29][30][31] The characterization of the miss sequence of the LRU cache was fulfilled in Jelenković and Kang. 26 They discovered that the missing stream from one single cache is approximated well by the superposition of some asymptotically independent renewal processes.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Analytical characterization of cache replacement policy impact on content delivery time in information‐centric networks

Hashemi

Bohlooli

2019

Int J Communication

View full text Add to dashboard Cite

Summary Information‐centric networking (ICN) has emerged as a promising candidate for designing content‐based future Internet paradigms. ICN increases the utilization of a network through location‐independent content naming and in‐network content caching. In routers, cache replacement policy determines which content to be replaced in the case of cache free space shortage. Thus, it has a direct influence on user experience, especially content delivery time. Meanwhile, content can be provided from different locations simultaneously because of the multi‐source property of the content in ICN. To the best of our knowledge, no work has yet studied the impact of cache replacement policy on the content delivery time considering multi‐source content delivery in ICN, an issue addressed in this paper. As our contribution, we analytically quantify the average content delivery time when different cache replacement policies, namely, least recently used (LRU) and random replacement (RR) policy, are employed. As an impressive result, we report the superiority of these policies in term of the popularity distribution of contents. The expected content delivery time in a supposed network topology was studied by both theoretical and experimental method. On the basis of the obtained results, some interesting findings of the performance of used cache replacement policies are provided.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Analytical characterization of cache replacement policy impact on content delivery time in information‐centric networks

Hashemi

Bohlooli

2019

Int J Communication

View full text Add to dashboard Cite

show abstract

“…The state-of-the-art cache eviction policies mainly include FIFO [63], simple Random Replacement (RR) [64], LRU [65], LFU [63], Least Recently/Frequently Used (LFRU) [66], LRU-k [67], Time Aware Least Recent Used (TLRU) [68], Frequency-Based-FIFO(FB-FIFO) [69], Aging popularity-based caching scheme (APC) [70] and Adaptive Replacement Cache(ARC) [71],etc. The processes of the cache eviction policies are analyzed as following.…”

Section: Cache Eviction Policiesmentioning

confidence: 99%

“…Several works characterize the content dynamics in a single cache or caching network by Markov chain [65,69,75,83,84].…”

Section: Modeling Behavior and Performance Analysis Of Caching Systemmentioning

confidence: 99%

See 1 more Smart Citation

Information-centric mobile caching network frameworks and caching optimization: a survey

Jin

Zhao

et al. 2017

J Wireless Com Network

View full text Add to dashboard Cite

The demand for content oriented service and compute-intensive service stimulates the shift of current cellular networks to deal with the explosive growth in mobile traffic. Information centric mobile caching network architectures have emerged in Information-Centric Networking as well as mobile cellular and ad-hoc networks deployed with caches. Caching optimization based on information centric mobile caching has become the key issue, and several significant research challenges remain to be addressed before its widespread adoption. In this paper, a brief survey on Information centric mobile caching network architecture and caching optimization is presented, including cache placement in different mobile wireless network architectures, the taxonomy of cache insertion and eviction policies, the modeling behavior of caching networks as well as caching optimization based on network centric and user centric metrics, and typical applications based on mobile caching. Finally, the research directions and open challenges are investigated.

show abstract

References

2017

Green Mobile Networks

View full text Add to dashboard Cite

Estimating Instantaneous Cache Hit Ratio Using Markov Chain Analysis

Cited by 40 publications

References 33 publications

Analytical characterization of cache replacement policy impact on content delivery time in information‐centric networks

Analytical characterization of cache replacement policy impact on content delivery time in information‐centric networks

Information-centric mobile caching network frameworks and caching optimization: a survey

References

Contact Info

Product

Resources

About