Heterogeneous wireless networks (HetNets) provide a powerful approach to meet the dramatic mobile traffic growth, but also impose a significant challenge on backhaul. Caching and multicasting at macro and pico base stations (BSs) are two promising methods to support massive content delivery and reduce backhaul load in HetNets. In this paper, we jointly consider caching and multicasting in a large-scale cache-enabled HetNet with backhaul constraints. We propose a hybrid caching design consisting of identical caching in the macro-tier and random caching in the pico-tier, and a corresponding multicasting design. By carefully handling different types of interferers and adopting appropriate approximations, we derive tractable expressions for the successful transmission probability in the general region as well as the high signal-to-noise ratio (SNR) and user density region, utilizing tools from stochastic geometry. Then, we consider the successful transmission probability maximization by optimizing the design parameters, which is a very challenging mixed discrete-continuous optimization problem. By using optimization techniques and exploring the structural properties, we obtain a near optimal solution with superior performance and manageable complexity. This solution achieves better performance in the general region than any asymptotically optimal solution, under a mild condition.The analysis and optimization results provide valuable design insights for practical cache-enabledThe rapid proliferation of smart mobile devices has triggered an unprecedented growth of the global mobile data traffic. HetNets have been proposed as an effective way to meet the dramatic traffic growth by deploying short range small-BSs together with traditional macro-BSs, to provide better time or frequency reuse [1]. However, this approach imposes a significant challenge of providing expensive high-speed backhaul links for connecting all the small-BSs to the core network [2].Caching at small-BSs is a promising approach to alleviate the backhaul capacity requirement in HetNets [3]-[5]. Many existing works have focused on optimal cache placement at small-BSs, which is of critical importance in cache-enabled HetNets. For example, in [6] and [7], the authors consider the optimal content placement at small-BSs to minimize the expected downloading time for files in a single macro-cell with multiple small-cells. File requests which cannot be satisfied locally at a small-BS are served by the macro-BS. The optimization problems in [6] and [7] are NP-hard, and low-complexity solutions are proposed. In [8], the authors propose a caching design based on file splitting and MDS encoding in a single macrocell with multiple small-cells. File requests which cannot be satisfied locally at a small-BS are served by the macro-BS, and backhaul rate analysis and optimization are considered. Note that the focuses of [6]-[8] are on performance optimization of caching design.In [9]-[11], the authors consider caching the most popular files at each small-BS in largescal...

Caching and multicasting at base stations are two promising approaches to support massive content delivery over wireless networks. However, existing analysis and designs do not fully explore and exploit the potential advantages of the two approaches. In this paper, we consider the analysis and optimization of caching and multicasting in a large-scale cache-enabled wireless network. We propose a random caching and multicasting scheme with a design parameter. By carefully handling different types of interferers and adopting appropriate approximations, we derive a tractable expression for the successful transmission probability in the general region, utilizing tools from stochastic geometry. We also obtain a closed-form expression for the successful transmission probability in the high signal-to-noise ratio (SNR) and user density region. Then, we consider the successful transmission probability maximization, which is a very complex non-convex problem in general.Using optimization techniques, we develop an iterative numerical algorithm to obtain a local optimal caching and multicasting design in the general region. To reduce complexity and maintain superior performance, we also derive an asymptotically optimal caching and multicasting design in the asymptotic region, based on a two-step optimization framework. Finally, numerical simulations show that the asymptotically optimal design achieves a significant gain in successful transmission probability over some baseline schemes in the general region.

In this tutorial paper, a comprehensive survey is given on several major systematic approaches in dealing with delay-aware control problems, namely the equivalent rate constraint approach, the Lyapunov stability drift approach and the approximate Markov Decision Process (MDP) approach using stochastic learning. These approaches essentially embrace most of the existing literature regarding delay-aware resource control in wireless systems. They have their relative pros and cons in terms of performance, complexity and implementation issues. For each of the approaches, the problem setup, the general solution and the design methodology are discussed. Applications of these approaches to delay-aware resource allocation are illustrated with examples in single-hop wireless networks. Furthermore, recent results regarding delay-aware multi-hop routing designs in general multi-hop networks are elaborated.Finally, the delay performance of the various approaches are compared through simulations using an example of the uplink OFDMA systems. Index TermsDelay-aware resource control, large deviation theory, Lyapunov stability, Markov decision process, stochastic learning.

No abstract