A New Upper Bound on Cache Hit Probability for Non-Anticipative Caching Policies.
Nitish K. PanigrahyPhilippe NainGiovanni NegliaDon TowsleyPublished in: ACM Trans. Model. Perform. Evaluation Comput. Syst. (2022)
Keyphrases
- upper bound
- prefetching
- cache replacement
- semantic caching
- user perceived latency
- lower bound
- web caching
- caching scheme
- data access
- error probability
- cache management
- hit ratio
- consistency maintenance
- query processing
- hit rate
- access latency
- access patterns
- proxy cache
- probability distribution
- cache hit ratio
- replacement policy
- worst case
- branch and bound algorithm
- lower and upper bounds
- caching strategies
- response time
- dynamic content
- distributed object
- optimal policy
- buffer management
- cache consistency
- mobile clients
- cache replacement algorithm
- mobile environments
- dynamic programming
- cached data
- web documents
- false alarm rate
- query result