An approximate dynamic programming approach for collaborative caching. Issue 6 (3rd June 2021)

• Record Type: Journal Article
• Authors: Yang, Xinan; Thomos, Nikolaos
• Is Part Of: Engineering optimization. Volume 53:Issue 6(2021)
• Page Start: 1005
• Page End: 1023
• Publication Date: 2021-06-03
• Subjects: Collaborative caching -- online/offline caching -- popularity dynamics -- finite horizon MDP -- approximate dynamic programming; Engineering design -- Periodicals; Mathematical optimization -- Periodicals; 620.0042
• DOI: 10.1080/0305215X.2020.1767098
• Languages: English
• ISSNs: 0305-215X

Abstract

Abstract : In this article, online collaborative content caching in wireless networks is studied from a network economics point of view. The cache optimization problem is first modelled as a finite horizon Markov decision process that incorporates an auto-regressive model to forecast the evolution of the content demands. The complexity of the problem grows exponentially with the system parameters, and even though a good approximation to the cost-to-go can be found, the single-stage decision problem is still NP-hard. To deal with cache optimization in industrial-size networks, a novel methodology called rolling horizon is proposed that solves the dimensionality of the problem by freezing the cache decisions for a short number of periods to construct a value function approximation. Then, to address the NP-hardness of the single-stage decision problem, two simplifications/reformulations are examined: (a) to limit the number of content replicas in the network and (b) to limit the allowed content replacements. The results show that the proposed approach can reduce the communication cost by over 84% compared to that of running least recently used updates on offline schemes in collaborative caching. The results also shed light on the trade-off between the efficiency of the caching policy and the time needed to run the online cache optimization algorithm.