Skip to content

Read-only version: For security reasons, the Research Information System (FIS) has been temporarily replaced by this read-only version. All public content and full texts remain available; login, editing, submission and statistics are not available. Questions: fis@uni-bamberg.de

Home › Publications › Analysis of LRU Cache Trees with a Power Law Reference Distribution

Publication

Analysis of LRU Cache Trees with a Power Law Reference Distribution

Krieger, Udo R.; Markovich, Natalia M. (2026): Analysis of LRU Cache Trees with a Power Law Reference Distribution, in: Bamberg: Otto-Friedrich-Universität, S. 162–167.

Details

Faculty/Chair
Faculty/Professorship
Author
Markovich, Natalia M.
Publisher Information
Otto-Friedrich-Universität : Bamberg
Year of publication
2026
Source/Other editions
Alexander Dudin, Alexander Gortsev, Anatoly Nazarov, u. a. (Hrsg.), Information Technologies and Mathematical Modelling : Queueing Theory and Applications ; 15th International Scientific Conference, ITMM 2016, named after A.F. Terpugov, Katun, Russia, September 12-16, 2016, Proceedings, Cham: Springer International Publishing, 2016, S. 162–167, ISBN: 978-3-319-44615-8
Year of first publication
2016
Language
English
Licence
URN
Abstract

We 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.

Keywords
LRU cache performance
Che’s approximation
Cache trees
Type
Conferenceobject
URI
Activation date
2026-04-27

Permalink: https://fis.uni-bamberg.de/handle/uniba/114830 · Data as JSON · Cite: BibTeX · RIS

Data as of: 2026-11-16

Restricted read-only access: login, editing and submission are temporarily disabled.