Optimal Designs of SVC-Based Content Placement and Delivery in Wireless Caching Networks

To allieviate the heavy traffic burden over backhaul links and improve the user's quality of service (QoS), edge caching plays an important role in wireless networks. This paper investigated the optimal designs of content placement and transmission in wireless caching networks. The contents to be cached and requested were encoded into individual layers by scalable video coding (SVC), and different sets of layers can provide different viewing qualities to end users. The demanded contents were provided by helpers caching the requested layers, or by the macro-cell base station (MBS) otherwise. In the content placement phase, this work formulated and solved the delay minimization problem. In the content transmission phase, the sum rate optimization problem was established. To effectively solve the nonconvex problem, the methods of semi-definite relaxation (SDR), successive convex approximation (SCA), and arithmetic-geometric mean (AGM) inequality were adopted, after which the original problem was transformed into the convex form. The numerical results show that the transmission delay is reduced by caching contents at helpers. Moreover, the fast convergence of the proposed algorithm for solving the sum rate maximization problem is presented, and the sum rate gain of edge caching is also revealed, as compared to the benchmark scheme without content caching.

Automated summary

This paper investigates the optimal designs of content placement and transmission in wireless caching networks. It proposes encoding contents into different layers to provide different viewing qualities, and caching at helpers to reduce transmission delay. The nonconvex problem is effectively solved using methods like SDR, SCA, and AGM inequality. Results show reduced transmission delay and increased sum rate gain compared to the benchmark scheme without content caching.