Optimal Task Offloading Policy in Edge Computing Systems with Firm Deadlines
Khai Doan, Wesley Araujo, Evangelos Kranakis, Ioannis Lambadaris,, Yannis Viniotis

TL;DR
This paper develops an optimal task offloading policy for UAV-assisted edge computing systems considering deadlines and costs, using dynamic programming and properties to reduce computational complexity.
Contribution
It formulates a dynamic programming approach for optimal UAV task offloading, identifies properties to simplify computation, and verifies results through numerical analysis.
Findings
Optimal policy derived using DP properties
Reduced computational complexity for infinite state space
Numerical results demonstrate parameter impacts
Abstract
The recent drastic increase in mobile data traffic has pushed the mobile edge computing systems to the limit of their capacity. A promising solution to this problem is the task migration provided by unmanned aerial vehicles (UAV). Key factors to be taken into account in the design of UAV offloading schemes must include the number of tasks waiting in the system as well as their corresponding deadlines. An appropriate system cost which is used as an objective function to be minimized comprises two parts. First, an offloading cost which can be interpreted as the cost of using computational resources at the UAV. Second, a penalty cost due to potential task expiration. In order to minimize the expected (time average) cost over a time horizon, we formulate a Dynamic Programming (DP) equation and analyze it to describe properties of a candidate optimal offloading policy. The DP equation…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAge of Information Optimization · Stochastic Gradient Optimization Techniques · Reinforcement Learning in Robotics
