# Joint Long-Term Cache Allocation and Short-Term Content Delivery in   Green Cloud Small Cell Networks

**Authors:** Xiongwei Wu, Qiang Li, Xiuhua Li, Victor C. M. Leung, P., C. Ching

arXiv: 1904.10882 · 2019-04-25

## TL;DR

This paper proposes a joint long-term cache allocation and short-term content delivery scheme for green cloud small cell networks, optimizing power use and reducing network traffic through a two-stage approach based on historical data.

## Contribution

It introduces a novel two-stage optimization framework for joint cache management and content delivery in C-SCNs, addressing the challenge of future request prediction.

## Key findings

- Significant power savings compared to conventional schemes
- Near-optimal performance close to genie-aided lower bound
- Effective cache updating strategy in low caching regions

## Abstract

Recent years have witnessed an exponential growth of mobile data traffic, which may lead to a serious traffic burn on the wireless networks and considerable power consumption. Network densification and edge caching are effective approaches to addressing these challenges. In this study, we investigate joint long-term cache allocation and short-term content delivery in cloud small cell networks (C-SCNs), where multiple smallcell BSs (SBSs) are connected to the central processor via fronthaul and can store popular contents so as to reduce the duplicated transmissions in networks. Accordingly, a long-term power minimization problem is formulated by jointly optimizing multicast beamforming, BS clustering, and cache allocation under quality of service (QoS) and storage constraints. The resultant mixed timescale design problem is an anticausal problem because the optimal cache allocation depends on the future file requests. To handle it, a two-stage optimization scheme is proposed by utilizing historical knowledge of users' requests and channel state information. Specifically, the online content delivery design is tackled with a penalty-based approach, and the periodic cache updating is optimized with a distributed alternating method. Simulation results indicate that the proposed scheme significantly outperforms conventional schemes and performs extremely close to a genie-aided lower bound in the low caching region.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1904.10882/full.md

## Figures

5 figures with captions in the complete paper: https://tomesphere.com/paper/1904.10882/full.md

## References

13 references — full list in the complete paper: https://tomesphere.com/paper/1904.10882/full.md

---
Source: https://tomesphere.com/paper/1904.10882