Cache Placement in Two-Tier HetNets with Limited Storage Capacity: Cache or Buffer?
arXiv:1806.02197
Abstract
In this paper, we aim to minimize the average file transmission delay via bandwidth allocation and cache placement in two-tier heterogeneous networks with limited storage capacity, which consists of cache capacity and buffer capacity. For average delay minimization problem with fixed bandwidth allocation, although this problem is nonconvex, the optimal solution is obtained in closed form by comparing all locally optimal solutions calculated from solving the Karush-Kuhn-Tucker conditions. To jointly optimize bandwidth allocation and cache placement, the optimal bandwidth allocation is first derived and then substituted into the original problem. The structure of the optimal caching strategy is presented, which shows that it is optimal to cache the files with high popularity instead of the files with big size. Based on this optimal structure, we propose an iterative algorithm with low complexity to obtain a suboptimal solution, where the closed-from expression is obtained in each step. Numerical results show the superiority of our solution compared to the conventional cache strategy without considering cache and buffer tradeoff in terms of delay.
References in corpus (8)
- Caching at the Wireless Edge: Design Aspects, Challenges and Future Directions
- Optimal Geographic Caching In Cellular Networks
- Wireless Caching: Technical Misconceptions and Business Barriers
- Mobility-Aware Caching for Content-Centric Wireless Networks: Modeling and Methodology
- Energy Efficient Resource Allocation in Machine-to-Machine Communications with Multiple Access and Energy Harvesting for IoT
- MIMO Relaying Broadcast Channels with Linear Precoding and Quantized Channel State Information Feedback
- Effective Capacity and Power Allocation for Machine-Type Communication
- Wireless Multihop Device-to-Device Caching Networks