马丽丽, 张文东, 李智威, 莫王昊. 基于李雅普诺夫优化的任务卸载优化算法[J]. 微电子学与计算机, 2022, 39(11): 19-26. DOI: 10.19304/J.ISSN1000-7180.2022.0242
引用本文: 马丽丽, 张文东, 李智威, 莫王昊. 基于李雅普诺夫优化的任务卸载优化算法[J]. 微电子学与计算机, 2022, 39(11): 19-26. DOI: 10.19304/J.ISSN1000-7180.2022.0242
MA Lili, ZHANG Wendong, LI Zhiwei, MO Wanghao. Task offloading optimization algorithm based on Lyapunov optimization[J]. Microelectronics & Computer, 2022, 39(11): 19-26. DOI: 10.19304/J.ISSN1000-7180.2022.0242
Citation: MA Lili, ZHANG Wendong, LI Zhiwei, MO Wanghao. Task offloading optimization algorithm based on Lyapunov optimization[J]. Microelectronics & Computer, 2022, 39(11): 19-26. DOI: 10.19304/J.ISSN1000-7180.2022.0242

基于李雅普诺夫优化的任务卸载优化算法

Task offloading optimization algorithm based on Lyapunov optimization

  • 摘要: 针对边缘计算环境下,任务卸载过程中任务的动态到达性和信道条件的不确定所引起的平均时延和能耗的优化问题,提出了一种基于李雅普诺夫优化的任务卸载优化算法.首先,采用李雅普诺夫优化方法把原问题转变为确定性的优化问题,将终端设备中待卸载的任务队列按照优先级传输至缓存基站,并对任务卸载过程中的队列长度进行约束和建模,使得队列长度可控,从而保证系统稳定性.其次,结合遗传算法正反馈机制、快速收敛性和蚁群算法全局快速搜索能力、求解精度效率高等优势,对缓存基站中带有优先级约束队列的实际状态来寻求近似最优的卸载路径,以便高效的将任务卸载到合适的移动边缘计算(Mobile Edge Computing,MEC)服务器中.最后,根据任务队列的约束和卸载路径的优化结果提出了一种启发式全局优化任务卸载算法.经过实验仿真,所提算法与现有的EEDOA研究方法相比,合理地约束队列长度与选择近似最优路径可有效降低任务的卸载能耗.

     

    Abstract: Aiming at the optimization problem of average delay and energy consumption caused by the dynamic arrival of tasks and the uncertainty of channel conditions in the process of task unloading in edge computing environment, a task offload optimization algorithm based on Lyapunov optimization is proposed. Firstly, the original problem is transformed into a deterministic optimization problem by using Lyapunov optimization method, and the task queue to be unloaded in the terminal equipment is transmitted to the cache base station according to priority. The queue length in the process of task unloading is constrained and modeled, which make queue length controllable to ensure system stability. Secondly, combined with the positive feedback mechanism of genetic algorithm, fast convergence and the advantages of fast global search ability and high precision efficiency of ant colony algorithm, the approximate optimal unloading path is found for the actual state of the cache base station with priority constraint queue, so as to the task can be offloaded to the appropriate mobile edge computing server efficiently. Finally, according to the constraints of the task queue and the optimization results of the offloading path, a heuristic global optimization task offloading algorithm is proposed. Compared with the existing EEDOA research methods through experimental simulation, the proposed algorithm can effectively reduce the unloading energy consumption of tasks by reasonably constraining the queue length and choosing the approximate optimal path.

     

/

返回文章
返回