On the asymptotics of fault probability in least-recently-used caching with Zipf-type request distribution

DOI10.1002/rsa.20098zbMath1112.68029OpenAlexW4231753933MaRDI QIDQ3419596

Toyoaki Sugimoto, Naoto Miyoshi

Publication date: 7 February 2007

Published in: Random Structures and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20098

zbMATH Keywords

negative associationleast-recently-used cachingZipf-type distributionmove-to-front algorithmdistributional tail asymptotics

Mathematics Subject Classification ID

Theory of operating systems (68N25) Tauberian theorems (11M45)

Related Items (1)

A fluid limit for a cache algorithm with general request processes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the asymptotics of fault probability in least-recently-used caching with Zipf-type request distribution