Cooperative Content Caching in MEC-Enabled Heterogeneous Cellular Networks
Multimedia content delivery via the cellular infrastructure increases fast due to the very high volumes of mobile video traffic generated by the billions of end devices populating the mobile data network. A critical mass of mobile video content requests refers to the consumption of the same popular...
Gespeichert in:
Veröffentlicht in: | IEEE access 2021, Vol.9, p.98883-98903 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Multimedia content delivery via the cellular infrastructure increases fast due to the very high volumes of mobile video traffic generated by the billions of end devices populating the mobile data network. A critical mass of mobile video content requests refers to the consumption of the same popular video content, which is consumed by different end terminals spanning small geographical regions. Such content requests place a great burden on the backhaul of content-agnostic cellular networks, which fail to exploit the correlation of video requests to decongest their backhaul links. This creates redundant retransmissions while fetching the same video content from a central server to the network edge, using the bandwidth-limited backhaul at peak-time periods. With the integration of multi-access edge computing (MEC) capabilities in 5G mobile cellular networks, mobile network operators can place popular video content closer to the network edge at off-peak time periods, predicting user requests exhibiting a high correlation for a given time interval over smaller geographical regions. In this paper, we investigate popular content placement in multi-tier heterogeneous cellular networks where the edge network infrastructure can cooperate to create content delivery (and placement) clusters to effectively serve correlated video requests. To this end, we model the cooperative content placement problem using the multiple knapsack problem (MKP) formulation and present an exact (optimal) bound-and-bound strategy to solve it. The performance of the proposed strategy is evaluated in-depth using extensive system-level simulations and is compared against that of other state-of-the-art algorithms. Valuable design guidelines and key performance trade-offs are discussed, paving the way towards cluster-based cooperative caching in MEC-enabled cellular network setups. |
---|---|
ISSN: | 2169-3536 2169-3536 |
DOI: | 10.1109/ACCESS.2021.3095356 |