Cache Placement in Two-Tier HetNets with Limited Storage Capacity: Cache or Buffer?

June 06, 2018 Β· Declared Dead Β· πŸ› IEEE Transactions on Communications

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Zhaohui Yang, Cunhua Pan, Yijin Pan, Yongpeng Wu, Wei Xu, Mohammad Shikh-Bahaei, Ming Chen arXiv ID 1806.02197 Category cs.IT: Information Theory Citations 42 Venue IEEE Transactions on Communications Last Checked 6 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted