Offloading Decision in Edge Computing for Continuous Applications Under Uncertainty

Wei Chang

doi:10.1109/TWC.2020.3001012

Return

Offloading Decision in Edge Computing for Continuous Applications Under Uncertainty

2020-09-01

PRE

Wei Chang

Yang Xiao

Wenjing Lou (Wenjing Lou)

Guochu Shou *

DOI：10.1109/TWC.2020.3001012

Original

Original request for help

Save

Abstract

En 中文

Edge computing (EC) is an emerging paradigm to push sufficient computation resources towards the network edge, improving application performance significantly by offloading applications to the edge computing node. We investigate continuous application offloading decision in EC, for which it is uncertain how users operate continuous applications and how long continuous applications last before completion. That means some characteristics of continuous applications, e.g., the number of user operations, the uploading and downloading data size for offloading computation of each user operation, and the number of central processing unit (CPU) cycles required to execute computation of each user operation, are unknown when making offloading decision. In this scenario, an energy consumption constrained average response time minimization problem among multiple users for continuous applications under uncertainty is formulated. To tackle this problem, we propose the Response Time-Improved Offloading algorithm with Energy Constraint (RTIOEC) to make offloading decision with fewer characteristics of applications. The evaluation results show that the RTIOEC algorithm achieves comparatively short average response time of continuous applications while satisfying the energy consumption constraint with a predefined upper bound of violation probability. Our results demonstrate the practicality of the RTIOEC algorithm in offloading decision in EC for continuous applications under uncertainty.

Keywords:

Uncertainty

Delays

Edge computing

Energy consumption

Games

Programming

Optimization

Edge computing

uncertainty

chance constrained programming

multi-dimensional knapsack problem

dynamic programming

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.