z-logo
open-access-imgOpen Access
A New Upper Bound on Cache Hit Probability for Non-Anticipative Caching Policies
Author(s) -
Nitish K. Panigrahy,
Philippe Nain,
Giovanni Neglia,
Don Towsley
Publication year - 2022
Publication title -
acm transactions on modeling and performance evaluation of computing systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.291
H-Index - 11
eISSN - 2376-3647
pISSN - 2376-3639
DOI - 10.1145/3547332
Subject(s) - cache , computer science , upper and lower bounds , object (grammar) , correctness , process (computing) , markov process , distributed computing , algorithm , parallel computing , operating system , mathematics , statistics , mathematical analysis , artificial intelligence

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom