MDS Coded Cooperative Caching for Heterogeneous Small Cell Networks

In this paper, the cooperative caching strategies are developed for a typical cache-enabled small cell network under heterogeneous file and network settings, where the neighboring base stations are enabled to collaborate to share the cached content. To make full usage of the content diversity in the caches, maximum distance separable (MDS) codes are used for content restructuring. The content placement and the cooperation policy among the neighboring base stations are jointly optimized to minimize the long-term average user attrition (UA) cost for fetching content from external storage subject to the cache capacity constraints. In addition to the unicast based cooperative caching scheme, a compound caching strategy, namely multicast-aware cooperative caching assuming fixed and dynamic cooperative policies, respectively, is developed to combine the merits of multicast-aware content delivery and cooperative content sharing. Mathematical analysis and simulation results are presented to illustrate the advantages of MDS coded cooperative caching strategies in terms of reducing the backhaul requirements

Optimizing MDS Codes for Caching at the Edge

In this paper we investigate the problem of optimal MDS-encoded cache placement at the wireless edge to minimize the backhaul rate in heterogeneous networks. We derive the backhaul rate performance of any caching scheme based on file splitting and MDS encoding and we formulate the optimal caching scheme as a convex optimization problem. We then thoroughly investigate the performance of this optimal scheme for an important heterogeneous network scenario. We compare it to several other caching strategies and we analyze the influence of the system parameters, such as the popularity and size of the library files and the capabilities of the small-cell base stations, on the overall performance of our optimal caching strategy. Our results show that the careful placement of MDS-encoded content in caches at the wireless edge leads to a significant decrease of the load of the network backhaul and hence to a considerable performance enhancement of the network.Comment: to appear in Globecom 201

Coding, Multicast and Cooperation for Cache-Enabled Heterogeneous Small Cell Networks

Caching at the wireless edge is a promising approach to dealing with massive content delivery in heterogeneous wireless networks, which have high demands on backhaul. In this paper, a typical cache-enabled small cell network under heterogeneous file and network settings is considered using maximum distance separable (MDS) codes for content restructuring. Unlike those in the literature considering online settings with the assumption of perfect user request information, we estimate the joint user requests using the file popularity information and aim to minimize the long-term average backhaul load for fetching content from external storage subject to the overall cache capacity constraint by optimizing the content placement in all the cells jointly. Both multicast-aware caching and cooperative caching schemes with optimal content placement are proposed. In order to combine the advantages of multicast content delivery and cooperative content sharing, a compound caching technique, which is referred to as multicast-aware cooperative caching, is then developed. For this technique, a greedy approach and a multicast-aware in-cluster cooperative approach are proposed for the small-scale networks and large-scale networks, respectively. Mathematical analysis and simulation results are presented to illustrate the advantages of MDS codes, multicast, and cooperation in terms of reducing the backhaul requirements for cache-enabled small cell networks

Caching in Heterogeneous Networks

A promising solution in order to cope with the massive request of wireless data traffic consists of having replicas of the potential requested content memorized across the network. In cache-enabled heterogeneous networks, content is pre-fetched close to the users during network off-peak periods in order to directly serve the users when the network is congested. In fact, the main idea behind caching is the replacement of backhaul capacity with storage capabilities, for example, at the edge of the network. Caching content at the edge of heterogeneous networks not only leads to significantly reduce the traffic congestion in the backhaul link but also leads to achieve higher levels of energy efficiency. However, the good performance of a system foresees a deep analysis of the possible caching techniques. Due to the physical limitation of the caches’ size and the excessive amount of content, the design of caching policies which define how the content has to be cached and select the likely data to store is crucial. Within this thesis, caching techniques for storing and delivering the content in heterogeneous networks are investigated from two different aspects. The first part of the thesis is focused on the reduction of the power consumption when the cached content is delivered over an Gaussian interference channel and per-file rate constraints are imposed. Cooperative approaches between the transmitters in order to mitigate the interference experienced by the users are analyzed. Based on such approaches, the caching optimization problem for obtaining the best cache allocation solution (in the sense of minimizing the average power consumption) is proposed. The second part of the thesis is focused on caching techniques at packet level with the aim of reducing the transmissions from the core of an heterogeneous network. The design of caching schemes based on rate-less codes for storing and delivering the cached content are proposed. For each design, the placement optimization problem which minimizes the transmission over the backhaul link is formulated