Analysis of LRU Cache Trees with a Power Law Reference Distribution

Krieger, Udo R.Udo R.KriegerMarkovich, Natalia M.Natalia M.Markovich2026-04-272026-04-272026https://fis.uni-bamberg.de/handle/uniba/114830We investigate the performance of a LRU cache replacement policy. Regarding the hit and miss ratios of Zipf-distributed frequencies of object requests in a cascade of LRU caches, new explicit, computationally tractable formulae are derived.engLRU cache performanceChe’s approximationCache treesAnalysis of LRU Cache Trees with a Power Law Reference Distributionconferenceobjecturn:nbn:de:bvb:473-irb-114830x