[Paper Review] Energy and Delay Optimization for Cache-Enabled Dense Small Cell Networks

Hao Wu, Hancheng Lu|arXiv (Cornell University)|Mar 10, 2018

Caching and Content Delivery20 references4 citations

TL;DR

This paper proposes a joint optimization framework for energy consumption and end-to-end file delivery delay in cache-enabled dense small cell networks (DSCNs). By formulating a mixed-integer programming (MIP) problem that jointly optimizes file placement, user association, and power control, and solving it via a two-stage approach—local popularity-based caching followed by Benders' decomposition—the proposed algorithm achieves optimal tradeoff between energy efficiency and delay across diverse network scenarios.

ABSTRACT

Caching popular files in small base stations (SBSs) has been proved to be an effective way to reduce bandwidth pressure on the backhaul links of dense small cell networks (DSCNs). Many existing studies on cache-enabled DSCNs attempt to improve user experience by optimizing end-to-end file delivery delay. However, under practical scenarios where files (e.g., video files) have diverse quality of service requirements, energy consumption at SBSs should also be concerned from the network perspective. In this paper,we attempt to optimize these two critical metrics in cache-enabled DSCNs. Firstly, we formulate the energy-delay optimization problem as a Mixed Integer Programming (MIP) problem, where file placement, user association and power control are jointly considered. To model the tradeoff relationship between energy consumption and end-to-end file delivery delay, a utility function linearly combining these two metrics is used as an objective function of the optimization problem. Then, we solve the problem in two stages, i.e. caching stage and delivery stage, based on the observation that caching is performed during off-peak time. At the caching stage, a local popular file placement policy is proposed by estimating user preference at each SBS. At the delivery stage, with given caching status at SBSs, the MIP problem is further decomposed by Benders' decomposition method. An efficient algorithm is proposed to approach the optimal association and power solution by iteratively shrinking the gap of the upper and lower bounds. Finally, extension simulations are performed to validate our analytical and algorithmic work. The results demonstrate that the proposed algorithms can achieve the optimal tradeoff between energy consumption and end-to-end file delivery delay.

Motivation & Objective

• Address the dual challenge of minimizing energy consumption and end-to-end file delivery delay in cache-enabled dense small cell networks (DSCNs).
• Recognize that existing works focus on delay reduction but overlook energy efficiency, especially under diverse QoS requirements for files like video.
• Formulate a joint optimization problem integrating file placement, user association, and power control to balance energy and delay metrics.
• Develop a two-stage solution: first, a local popular file placement policy based on estimated user preferences; second, Benders’ decomposition to solve the MIP problem efficiently.
• Achieve a near-optimal tradeoff between energy efficiency and delay while accounting for variable file quality-of-service (QoS) requirements.

Proposed method

• Formulate the energy-delay optimization as a Mixed Integer Programming (MIP) problem with a utility function combining energy and delay metrics.
• Decompose the problem into two stages: caching (off-peak) and delivery (real-time), leveraging the fact that caching decisions are made during low-traffic periods.
• Propose a local popular file placement policy that estimates user preferences at each small base station (SBS) to maximize caching hit probability.
• Apply Benders’ decomposition to the delivery-stage MIP problem, iteratively tightening the duality gap between upper and lower bounds.
• Use Lagrangian relaxation and duality theory to prove equivalence between the original MIP and the relaxed subproblem, ensuring convergence to optimal solutions.
• Design an efficient iterative algorithm that alternately solves the master and subproblems to approach the optimal user association and power control strategy.

Experimental results

Research questions

• RQ1 How can energy consumption and end-to-end file delivery delay be jointly optimized in cache-enabled dense small cell networks?
• RQ2 What is the impact of user association and power control on the tradeoff between energy efficiency and delay in DSCNs with heterogeneous file QoS requirements?
• RQ3 Can a two-stage optimization framework—caching during off-peak and delivery during peak—effectively balance energy and delay?
• RQ4 To what extent does Benders’ decomposition improve the efficiency and optimality of solving the joint optimization problem?
• RQ5 How does local file popularity estimation at SBSs affect the overall caching hit ratio and system performance?

Key findings

• The proposed two-stage algorithm achieves the optimal tradeoff between energy consumption and end-to-end file delivery delay across various network scenarios.
• Benders’ decomposition effectively reduces the computational complexity of solving the joint MIP problem by decomposing it into manageable subproblems.
• The local popular file placement policy significantly improves caching hit probability by leveraging SBS-specific user preference estimation.
• The duality gap between upper and lower bounds is iteratively minimized, ensuring convergence to the optimal solution with high accuracy.
• Simulation results validate that the proposed method outperforms baseline schemes in balancing energy efficiency and delay, especially under high file diversity and QoS variation.
• The theoretical equivalence between the original MIP and the relaxed subproblem is proven via Lagrangian duality, confirming the algorithm’s optimality.