# Energy-Efficient Proactive Caching for Fog Computing with Correlated   Task Arrivals

**Authors:** Hong Xing, Jingjing Cui, Yansha Deng, Arumugam Nallanathan

arXiv: 1908.06334 · 2019-08-20

## TL;DR

This paper proposes an energy-efficient proactive caching strategy for fog computing systems with correlated task arrivals, optimizing offloading and caching to minimize energy consumption under deadline constraints.

## Contribution

It introduces a novel joint optimization framework for proactive caching and offloading in fog computing with correlated tasks, including an offline solution and an online algorithm under prediction errors.

## Key findings

- Offline solution provides a theoretical upper bound.
- Online algorithm performs well despite prediction errors.
- Proactive caching significantly reduces energy consumption.

## Abstract

With the proliferation of latency-critical applications, fog-radio network (FRAN) has been envisioned as a paradigm shift enabling distributed deployment of cloud-clone facilities at the network edge. In this paper, we consider proactive caching for a one-user one-access point (AP) fog computing system over a finite time horizon, in which consecutive tasks of the same type of application are temporarily correlated. Under the assumption of predicable length of the task-input bits, we formulate a long-term weighted-sum energy minimization problem with three-slot correlation to jointly optimize computation offloading policies and caching decisions subject to stringent per-slot deadline constraints. The formulated problem is hard to solve due to the mixed-integer non-convexity. To tackle this challenge, first, we assume that task-related information are perfectly known {\em a priori}, and provide offline solution leveraging the technique of semi-definite relaxation (SDR), thereby serving as theoretical upper bound. Next, based on the offline solution, we propose a sliding-window based online algorithm under arbitrarily distributed prediction error. Finally, the advantage of computation caching as well the proposed algorithm is verified by numerical examples by comparison with several benchmarks.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1908.06334/full.md

## Figures

6 figures with captions in the complete paper: https://tomesphere.com/paper/1908.06334/full.md

## References

13 references — full list in the complete paper: https://tomesphere.com/paper/1908.06334/full.md

---
Source: https://tomesphere.com/paper/1908.06334