Network cache design under stationary requests: Exact analysis and Poisson approximation

Abstract

The design of caching algorithms to maximize hit probability has been extensively studied. In this paper, we associate each content with a utility, which is a function of either the corresponding content hit rate. We formulate a cache optimization problem to maximize the sum of utilities over all contents under stationary and ergodic request processes. This problem is non-convex in general but we reformulate it as a convex optimization problem when the inter-request time (irt) distribution has a non-increasing hazard rate function. We provide explicit optimal solutions for some irt distributions. We formulate a reverse engineering based dual implementation of LRU under stationary arrivals. We also propose online algorithms that can be implemented using limited information and use a discrete time Lyapunov technique (DTLT) to correctly characterize their stability. Informed by these results, we further propose lightweight Poisson approximate online algorithms that are accurate and efficient in achieving optimal hit rates. We compare the solutions of the hit-rate based (HRB) and hit-probability based (HPB) problems. We find that online algorithms that solve HRB are more robust than online HPB algorithms.