A Coupon Collector based approximation for LRU cache hits under Zipf requests

The Least Recently Used (LRU) policy is widely used in caching, since it is computationally inexpensive and can be implemented ‘on-the-fly.’ However, existing analyses of content- wise hit-rates under LRU have expressions whose complexity grows rapidly with the buffer size. In this paper, we derive a simple yet accurate approximation for the LRU content-wise hitrates under Zipf-distributed request...