MADDPG-Based Offloading Strategy for Timing-Dependent Tasks in Edge Computing

Yuchen Wang, Zishan Huang, Zhongcheng Wei and Jijun Zhao ()
Additional contact information
Yuchen Wang: School of Information and Electrical Engineering, Hebei University of Engineering, Handan 056038, China
Zishan Huang: School of Information and Electrical Engineering, Hebei University of Engineering, Handan 056038, China
Zhongcheng Wei: School of Information and Electrical Engineering, Hebei University of Engineering, Handan 056038, China
Jijun Zhao: School of Information and Electrical Engineering, Hebei University of Engineering, Handan 056038, China

Future Internet, 2024, vol. 16, issue 6, 1-20

Abstract: With the increasing popularity of the Internet of Things (IoT), the proliferation of computation-intensive and timing-dependent applications has brought serious load pressure on terrestrial networks. In order to solve the problem of computing resource conflict and long response delay caused by concurrent application service applications from multiple users, this paper proposes an improved edge computing timing-dependent, task-offloading scheme based on Multi-Agent Deep Deterministic Policy Gradient (MADDPG) that aims to shorten the offloading delay and improve the resource utilization rate by means of resource prediction and collaboration among multiple agents to shorten the offloading delay and improve the resource utilization. First, to coordinate the global computing resource, the gated recurrent unit is utilized, which predicts the next computing resource requirements of the timing-dependent tasks according to historical information. Second, the predicted information, the historical offloading decisions and the current state are used as inputs, and the training process of the reinforcement learning algorithm is improved to propose a task-offloading algorithm based on MADDPG. The simulation results show that the algorithm reduces the response latency by 6.7% and improves the resource utilization by 30.6% compared with the suboptimal benchmark algorithm, and it reduces nearly 500 training rounds during the learning process, which effectively improves the timeliness of the offloading strategy.

Keywords: edge computing; task dependency; computational offloading; resource prediction; deep reinforcement learning; multi-agent collaboration (search for similar items in EconPapers)
JEL-codes: O3 (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/1999-5903/16/6/181/pdf (application/pdf)
https://www.mdpi.com/1999-5903/16/6/181/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jftint:v:16:y:2024:i:6:p:181-:d:1398494

Access Statistics for this article

Future Internet is currently edited by Ms. Grace You

More articles in Future Internet from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().