计算机科学
计算卸载
Lyapunov优化
最优化问题
分布式计算
数学优化
云计算
延迟(音频)
边缘计算
算法
操作系统
混乱的
李雅普诺夫指数
人工智能
电信
Lyapunov重新设计
数学
作者
Dang Van Huynh,Van‐Dinh Nguyen,Symeon Chatzinotas,Saeed R. Khosravirad,H. Vincent Poor,Trung Q. Duong
标识
DOI:10.1109/jsac.2022.3227088
摘要
In this paper, we study joint communication and computation offloading (JCCO) for hierarchical edge-cloud systems with ultra-reliable and low latency communications (URLLC). We aim to minimize the end-to-end (e2e) latency of computational tasks among multiple industrial Internet of Things (IIoT) devices by jointly optimizing offloading probabilities, processing rates, user association policies and power control subject to their service delay and energy consumption requirements as well as queueing stability conditions. The formulated JCCO problem belongs to a difficult class of mixed-integer non-convex optimization problem, making it computationally intractable. In addition, a strong coupling between binary and continuous variables and the large size of hierarchical edge-cloud systems make the problem even more challenging to solve optimally. To address these challenges, we first decompose the original problem into two subproblems based on the unique structure of the underlying problem and leverage the alternating optimization (AO) approach to solve them in an iterative fashion by developing newly convex approximate functions. To speed up optimal user association searching, we incorporate a penalty function into the objective function to resolve uncertainties of a binary nature. Two sub-optimal designs for given user association policies based on channel conditions and random user associations are also investigated to serve as state-of-the-art benchmarks. Numerical results are provided to demonstrate the effectiveness of the proposed algorithms in terms of the e2e latency and convergence speed.
科研通智能强力驱动
Strongly Powered by AbleSci AI