作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2023, Vol. 49 ›› Issue (4): 149-158. doi: 10.19678/j.issn.1000-3428.0064783

• 先进计算与数据处理 • 上一篇    下一篇

具有边缘缓存机制的混合启发式任务卸载算法

桑永宣1, 魏江坡1, 王博1, 宋莹2   

  1. 1. 郑州轻工业大学 软件学院, 郑州 450001;
    2. 北京信息科技大学 计算机学院, 北京 100101
  • 收稿日期:2022-05-23 修回日期:2022-07-15 发布日期:2023-04-07
  • 作者简介:桑永宣(1982-),女,副教授、博士,主研方向为云计算、网络空间安全;魏江坡,硕士研究生;王博、讲师、博士;宋莹(通信作者),副教授、博士。
  • 基金资助:
    国家自然科学基金面上项目(61872043);河南省重点研发与推广专项(科技攻关)(232102211084);河南省高等学校重点科研项目(21A520050)。

Hybrid Heuristic Task Offloading Algorithm with Edge Caching Mechanism

SANG Yongxuan1, WEI Jiangpo1, WANG Bo1, SONG Ying2   

  1. 1. College of Software Engineering, Zhengzhou University of Light Industry, Zhengzhou 450001, China;
    2. Computer School, Beijing Information Science and Technology University, Beijing 100101, China
  • Received:2022-05-23 Revised:2022-07-15 Published:2023-04-07

摘要: 边缘计算因其与用户物理距离短、响应速度快等特点,被认为是可以解决未来大规模网络计算资源不足等问题的关键技术之一。在多进多出的边缘计算环境下,通过将部分服务缓存到边缘节点可以降低用户请求任务的执行时间。但以往工作或假设边缘节点具有无限的缓存空间,或忽略当前缓存列表和缓存替换机制对任务卸载的影响,导致卸载决策失效或任务执行时间变长。面向具有缓存机制的边缘计算环境,提出一种基于整数编码的混合启发式任务卸载算法IPSO_GA,将任务卸载问题建模为一个混合整数非线性规划问题。结合粒子群优化和遗传算法,使各粒子通过交配运算和变异运算不断寻优,在合理的时间复杂度内搜索任务卸载决策。实验结果表明,与随机算法、贪心算法、平均算法等经典算法和目前较新算法相比,IPSO_GA算法在设备数量居中环境中的任务执行时间减少了58%~298%,能适用于设备数量多、计算密集的边缘计算环境。

关键词: 边缘计算, 任务卸载, 边缘缓存, 粒子群优化算法, 遗传算法

Abstract: Edge computing is considered one of the key technologies that can solve the problem of insufficient computing resources in large-scale networks in the future due to its short physical distance from users and fast response speed.In the multi-in multi-out edge computing environment, some services can be cached at the edge nodes to reduce the execution time of user-requested tasks.However, previous studies assumed that the edge nodes have infinite cache space or ignored the fact that the current cache list and cache replacement mechanism impact task offloading.This may invalidate the offloading decision and delay the execution of tasks.Therefore, a hybrid heuristic algorithm called IPSO_GA based on integer coding is proposed for the edge computing environment with the caching mechanism.The task offloading problem is modeled as a mixed-integer nonlinear programming problem.Combined with particle swarm optimization and Genetic Algorithm(GA), each particle constantly searches for an optimal solution through mating and variational operations, which can search for task offloading decisions within a reasonable time complexity.Experimental results show that the IPSO_GA algorithm reduces task execution time by approximately 58% to 298% compared with classical algorithms such as the Random algorithm, Greedy algorithm, Even algorithm, and the current newer algorithms, and can be applied to edge computing environments with a large number of devices and intensive computation.

Key words: edge computing, task offloading, edge caching, particle swarm optimization, Genetic Algorithm(GA)

中图分类号: