2019/01/09 by Ghafour Ahani, Ahani, Ghafour, Di Yuan +1
Computer Science · #Caching and Content Delivery #Cooperative Communication and Network Coding #Distributed #FOS: Computer and information sciences #Opportunistic and Delay-Tolerant Networks #Parallel #and Cluster Computing (cs.DC)
paper · pdf · doi:10.48550/arxiv.1901.02750
openalex publication_date 2019/01/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Caching popular contents at edge devices is an effective solution to alleviate the burden of the backhaul networks. Earlier investigations commonly neglected the storage cost in caching. More recently, retention-aware caching, where both the downloading cost and storage cost are accounted for, is attracting attention. Motivated by this, we address proactive and retention-aware caching with user mobility, optimizing the sum of the two types of costs. This is a combinatorial optimization problem. However, we derive a stream of analytical results and they together lead to an algorithm that guarantees global optimum with polynomial-time complexity. Numerical results show significant improvements in comparison to popular caching and random caching.