2017/10/02 by Syed Tamoor-ul-Hassan, Tamoor-ul-Hassan, Syed, Sumudu Samarakoon +7
Computer Science · #Caching and Content Delivery #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Networking and Internet Architecture (cs.NI) #Opportunistic and Delay-Tolerant Networks
paper · pdf · doi:10.48550/arxiv.1710.00506
openalex publication_date 2017/10/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper studies content caching in cloud-aided wireless networks where small cell base stations with limited storage are connected to the cloud via limited capacity fronthaul links. By formulating a utility (inverse of service delay) maximization problem, we propose a cache update algorithm based on spatio-temporal traffic demands. To account for the large number of contents, we propose a content clustering algorithm to group similar contents. Subsequently, with the aid of regret learning at small cell base stations and the cloud, each base station caches contents based on the learned content popularity subject to its storage constraints. The performance of the proposed caching algorithm is evaluated for sparse and dense environments while investigating the tradeoff between global and local class popularity. Simulation results show 15% and 40% gains in the proposed method compared to various baselines.