Hybrid content caching for low end-to-end latency in cloud-based wireless networks

• Published in: 2017 IEEE International Conference on Communications (ICC) pp. 1 - 6
• Main Authors: Jeongho Kwak, Yeongjin Kim, Long Bao Le, Song Chong
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.05.2017
• Subjects: Algorithm design and analysis; Approximation algorithms; Cloud computing; Copper; Heuristic algorithms; Servers; Wireless networks
• ISSN: 1938-1883
• DOI: 10.1109/ICC.2017.7996631

In this paper, we consider the content caching design without requiring historical content access information or content popularity profiles in a hierarchical cellular network architecture. Our design aims to dynamically select caching locations for different contents where caching locations can be content servers, cloud units (CUs), and base stations (BSs). Our design objective is to support as high content request rates as possible while maintaining the finite service time. To tackle this design problem, we employ the Lyapunov optimization method where the caching algorithm is developed by minimizing the Lyapunov drift of a quadratic Lyapunov function of virtual queue backlogs. This solution approach requires to solve a max-weight problem, which is an NP-hard and difficult problem to solve due to the coupling between CU caching and BS caching decisions. By exploiting the submodularity of the objective function, we propose a hybrid caching algorithm which achieves the constant approximation ratio to the optimal performance. Trace-driven simulation results demonstrate that the proposed joint CU/BS caching algorithm achieves almost the same performance with the exhaustive search and outperforms the independent caching algorithm and heuristic joint caching algorithms in terms of average end-to-end latency and backhaul load reduction ratio.