The tremendous expansion of edge data traffic poses great challenges to network bandwidth and service responsiveness for mobile computing. Edge caching has emerged as a promising method to alleviate these issues by storing a portion of data at the network edge. However, existing caching approaches suffer from either poor caching efficiency with low content-hit ratio or unintelligence of caching policies lacking self-adjustability. In this paper, we propose ICE, a novel Intelligent Edge Caching scheme using a deep reinforcement learning (DRL) method to capture specific valuable information from the requested data. With the benefit of our proposed popularity model based on Newton's law of cooling, ICE fully takes into account the popularity of the contents to be cached and leverages the formulated Markov decision model to decide whether or not the contents should be cached. Moreover, to further improve the caching efficiency, we propose a novel distributed multi-node caching framework, named DCCC, assisted by a multi-tiered caching hierarchy. Comprehensive experiments show that the single-node ICE scheme greatly improves the cache hit rate and contents exchanging time in comparison with both DRL-based and legacy approaches, and our distributed multi-node caching scheme DCCC further significantly improves the overall utilization of caching space.

The unprecedented growth of mobile data traffic brings unique challenges for network bandwidth and server resources to meet the diverse QoE (Quality of Experience). Caching becomes a promising way to alleviate these issues by storing a subset of data at the network edge, for which caching policy becomes critical. To this end, various caching schemes have been put forward, however, these schemes are either not intelligent lacking the ability of self-learning and self-decision-making, or inefficient with low data hit rate. Based on these observations, in this paper, we propose a novel Intelligent Caching framework at the Edge, named ICE, via deep reinforcement learning to capture certain valued information of the requested data. Notably, in our approach, the popularity of the data to be cached will be explored and considered. A Markov decision model is further developed to determine whether the data should be cached. The evaluation shows that ICE greatly improves the hit rate in comparison with the state-of-the-art approaches, and reduces the energy consumption for data transmission. Furthermore, based on ICE, the users' QoE is greatly improved. In conclusion, both theoretical analysis and experimental results prove the effectiveness and high performance of ICE compared with conventional strategies.

Analytics-as-a-service, or analytics job service, is emerging as a new paradigm for data analytics, be it in a cloud environment or within enterprises. In this setting, users are not required to manage or tune their hardware and software infrastructure, and they pay only for the processing resources consumed per job. However, the shared nature of these job services across several users and teams leads to significant overlaps in partial computations, i.e., parts of the processing are duplicated across multiple jobs, thus generating redundant costs. In this paper, we describe a computation reuse framework, coined CLOUDVIEWS, which we built to address the computation overlap problem in Microsoft's SCOPE job service. We present a detailed analysis from our production workloads to motivate the computation overlap problem and the possible gains from computation reuse. The key aspects of our system are the following: (i) we reuse computations by creating materialized views over recurring workloads, i.e., periodically executing jobs that have the same script templates but process new data each time, (ii) we select the views to materialize using a feedback loop that reconciles the compile-time and run-time statistics and gathers precise measures of the utility and cost of each overlapping computation, and (iii) we create materialized views in an online fashion, without requiring an offline phase to materialize the overlapping computations.