计算机科学
能源消耗
Dijkstra算法
服务器
GSM演进的增强数据速率
任务(项目管理)
移动边缘计算
过程(计算)
能量(信号处理)
路径(计算)
实时计算
构造(python库)
分布式计算
最短路径问题
计算机网络
人工智能
图形
理论计算机科学
操作系统
生态学
经济
统计
管理
生物
数学
作者
Ao Xiong,Chen Meng,Shaoyong Guo,Yongjie Li,Yujing Zhao,Qinghai Ou,Chuan Liu,Siwen Xu,Xiangang Liu
标识
DOI:10.32604/iasc.2022.018881
摘要
To solve the problem of energy consumption optimization of edge servers in the process of edge task unloading, we propose a task unloading algorithm based on reinforcement learning in this paper. The algorithm observes and analyzes the current environment state, selects the deployment location of edge tasks according to current states, and realizes the edge task unloading oriented to energy consumption optimization. To achieve the above goals, we first construct a network energy consumption model including servers’ energy consumption and link transmission energy consumption, which improves the accuracy of network energy consumption evaluation. Because of the complexity and variability of the edge environment, this paper designs a task unloading algorithm based on Proximal Policy Optimization (PPO), besides we use Dijkstra to determine the connection path between edge servers where adjacent tasks are deployed. Finally, lots of simulation experiments verify the effectiveness of the proposed method in the process of task unloading. Compared with contrast algorithms, the average energy saving of the proposed algorithm can reach 22.69%.
科研通智能强力驱动
Strongly Powered by AbleSci AI