Non-clairvoyant and randomised online task offloading in mobile edge computing

In this paper, we consider non-clairvoyant task offloading for random tasks in mobile edge computing within the framework of combinatorial optimisation. For offline non-clairvoyant task offloading, we propose a non-clairvoyant task offloading algorithm, which is able to determine a task offloading strategy without knowing the amount of computation and communication of any task. For online non-clairvoyant task offloading, we propose a randomised online task offloading algorithm, which is able to make an offloading decision for an arrival task without knowing anything about future tasks and other tasks. For both algorithms, we analyse the probability of certain performance guarantee. We also demonstrate numerical data. To the best of the author's knowledge, this is the first paper which considers both offline and online non-clairvoyant task offloading in mobile edge computing, together with analytical results on performance guarantee with high probability.