Optimizing Timer-based Policies for General Cache Networks

Abstract Caching algorithms are usually described by the eviction method and analyzed using a metric of hit probability. Since contents have different importance (e.g. popularity), the utility of a high hit probability, and the cost of transmission can vary across contents. In this paper, we consider timer-based (TTL) policies across a cache network, where contents have differentiated timers over which we optimize. Each content is associated with a utility measured in terms of the corresponding hit probability. We start our analysis from a linear cache network: we propose a utility maximization problem where the objective is to maximize the sum of utilities and a cost minimization problem where the objective is to minimize the content transmission cost across the network. These frameworks enable us to design online algorithms for cache management, for which we prove achieving optimal performance. Informed by the results of our analysis, we formulate a non-convex optimization problem for a general cache network. We show that the duality gap is zero, hence we can develop a distributed iterative primal-dual algorithm for content management in the network. Numerical evaluations show that our algorithm significant outperforms path replication with traditional caching algorithms over some network topologies. Finally, we consider a direct application of our cache network model to content distribution.
  • Nitish Panigrahy (UMass)
  • Jian Li (UMass)
  • Faheem Zafari (Imperial)
  • Don Towsley (UMass)
  • Paul Yu (ARL)
Date May-2018
Venue arXiv:1711.03941v2 [cs.NI] 14 May 2018