Abstract

Edge computing is an indispensable technology that overcomes delay limitations of cloud computing. In edge computing, computational resources are deployed at the network edge, and computational tasks and data of end terminals can be efficiently processed by edge nodes. Considering the computational resource limitations of edge nodes, collaborative edge computing integrates computational resources of edge nodes and provides more efficient computing services for end terminals. This article considers a computation offloading problem in collaborative edge computing networks, where computation offloading and resource allocation are optimized by means of a collaborative load shedding approach: a terminal can offload a computing task to an edge node, which either can process the task with its computing resource or further offload the task to other edge nodes. Long-term objectives and long-term constraints are considered, and Lyapunov optimization is applied to convert the original nonconvex computation offloading problem into a second problem that approximate the original problem and it is still nonconvex but has a special structure, which gives rise to a new distributed algorithm that optimally solves the second problem. Finally, the performance and provable bound of the distributed algorithm is theoretically analyzed. Numerical results demonstrate that the distributed algorithm can achieve a guaranteed long-term performance, and also demonstrate the improvement in performance achieved over the case of computation offloading without collaborating edge nodes.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call