2018
DOI: 10.1109/tcomm.2018.2846633
|View full text |Cite
|
Sign up to set email alerts
|

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

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 ba… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
34
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 43 publications
(34 citation statements)
references
References 54 publications
0
34
0
Order By: Relevance
“…. , q in,N C ] be the content request distribution [16] of user i during a period n where q in,k represents the probability that user i requests content k and N C is the total number of contents that each user can request. For different periods, the content request distribution of each user will be different.…”
Section: Data Correlationmentioning
confidence: 99%
“…. , q in,N C ] be the content request distribution [16] of user i during a period n where q in,k represents the probability that user i requests content k and N C is the total number of contents that each user can request. For different periods, the content request distribution of each user will be different.…”
Section: Data Correlationmentioning
confidence: 99%
“…Since cache memory is usually limited on devices, some contents may not be pre-cached. When delivering uncached contents, the buffer can temporally store the contents as a short-term memory [11]. Considering that CHs usually have a small coverage, contents cached at these CHs (ahead of time) may not be requested by CRs within coverage (later on).…”
Section: Introductionmentioning
confidence: 99%
“…Considering both cache-and buffer-enabled networks, the average delay was optimized with the fixed buffer capacity constraint in [13]. In [11], the authors proposed a joint spectrum allocation and cache placement scheme to optimize the average latency considering the storage capacity constraint. However, both of these two works investigated the effect of buffer on SBS instead of on device level, and thus ignored the effect of inter-device social relations on content delivery.…”
Section: Introductionmentioning
confidence: 99%
“…They showed that the optimal solution depends on cache sizes and base stations densities. In [28], Yang et al proposed a similar framework to [27]. However, they aimed at minimizing the average file transmission delay through caching and bandwidth allocation.…”
mentioning
confidence: 99%
“…This situation restrains the real potential of the multi-tier network. For [26], no theoretical analysis was realized and optimization is limited to caching placement only, while [27], [28] did not consider D2D communications.…”
mentioning
confidence: 99%