A New Upper Bound on Cache Hit Probability for Non-anticipative Caching Policies.
Nitish K. PanigrahyPhilippe NainGiovanni NegliaDon TowsleyPublished in: CoRR (2021)
Keyphrases
- upper bound
- prefetching
- cache replacement
- semantic caching
- lower bound
- cache management
- caching scheme
- user perceived latency
- error probability
- web caching
- data access
- hit ratio
- hit rate
- query processing
- consistency maintenance
- caching strategies
- proxy cache
- worst case
- dynamic content
- response time
- access latency
- probability distribution
- optimal policy
- access patterns
- false alarm rate
- replacement policy
- lower and upper bounds
- branch and bound algorithm
- main memory
- mobile environments
- buffer management
- highly scalable
- cache consistency
- streaming media
- web documents
- garbage collection
- query result