• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
高级检索

一种基于K-shell影响力最大化的路径择优计算迁移算法

乐光学, 陈光鲁, 卢敏, 杨晓慧, 刘建华, 黄淳岚, 杨忠明

乐光学, 陈光鲁, 卢敏, 杨晓慧, 刘建华, 黄淳岚, 杨忠明. 一种基于K-shell影响力最大化的路径择优计算迁移算法[J]. 计算机研究与发展, 2021, 58(9): 2025-2039. DOI: 10.7544/issn1000-1239.2021.20200338
引用本文: 乐光学, 陈光鲁, 卢敏, 杨晓慧, 刘建华, 黄淳岚, 杨忠明. 一种基于K-shell影响力最大化的路径择优计算迁移算法[J]. 计算机研究与发展, 2021, 58(9): 2025-2039. DOI: 10.7544/issn1000-1239.2021.20200338
Yue Guangxue, Chen Guanglu, Lu Min, Yang Xiaohui, Liu Jianhua, Huang Chunlan, Yang Zhongming. A Computation Offloading Algorithm with Path Selection Based on K-shell Influence Maximization[J]. Journal of Computer Research and Development, 2021, 58(9): 2025-2039. DOI: 10.7544/issn1000-1239.2021.20200338
Citation: Yue Guangxue, Chen Guanglu, Lu Min, Yang Xiaohui, Liu Jianhua, Huang Chunlan, Yang Zhongming. A Computation Offloading Algorithm with Path Selection Based on K-shell Influence Maximization[J]. Journal of Computer Research and Development, 2021, 58(9): 2025-2039. DOI: 10.7544/issn1000-1239.2021.20200338
乐光学, 陈光鲁, 卢敏, 杨晓慧, 刘建华, 黄淳岚, 杨忠明. 一种基于K-shell影响力最大化的路径择优计算迁移算法[J]. 计算机研究与发展, 2021, 58(9): 2025-2039. CSTR: 32373.14.issn1000-1239.2021.20200338
引用本文: 乐光学, 陈光鲁, 卢敏, 杨晓慧, 刘建华, 黄淳岚, 杨忠明. 一种基于K-shell影响力最大化的路径择优计算迁移算法[J]. 计算机研究与发展, 2021, 58(9): 2025-2039. CSTR: 32373.14.issn1000-1239.2021.20200338
Yue Guangxue, Chen Guanglu, Lu Min, Yang Xiaohui, Liu Jianhua, Huang Chunlan, Yang Zhongming. A Computation Offloading Algorithm with Path Selection Based on K-shell Influence Maximization[J]. Journal of Computer Research and Development, 2021, 58(9): 2025-2039. CSTR: 32373.14.issn1000-1239.2021.20200338
Citation: Yue Guangxue, Chen Guanglu, Lu Min, Yang Xiaohui, Liu Jianhua, Huang Chunlan, Yang Zhongming. A Computation Offloading Algorithm with Path Selection Based on K-shell Influence Maximization[J]. Journal of Computer Research and Development, 2021, 58(9): 2025-2039. CSTR: 32373.14.issn1000-1239.2021.20200338

一种基于K-shell影响力最大化的路径择优计算迁移算法

基金项目: 国家自然科学基金项目(U19B2015);浙江省“鲲鹏行动”计划支持项目
详细信息
  • 中图分类号: TP393

A Computation Offloading Algorithm with Path Selection Based on K-shell Influence Maximization

Funds: This work was supported by the National Natural Science Foundation of China (U19B2015) and the Top-level Talent Project of Zhejiang Province.
  • 摘要: 在移动边缘计算网络中,高效的计算迁移算法是移动边缘计算的重要问题之一.为了提高计算迁移算法性能,应用同类问题的相互转换性和最大化影响力模型,利用K-shell算法对边缘服务器进行等级划分,考虑边缘服务器负载过重问题,构建路径重叠(path overlap, PO)算法,引入通信质量、交互强度、列队处理能力等指标进行边缘服务器路径优化,将优化计算任务迁移路径问题转化为社会网络影响力最大化问题求解.基于K-shell影响力最大化思想,联合优化改进贪心与启发式算法,提出一种K-shell影响力最大化计算迁移(K-shell influence maximization computation offloading, Ks-IMCO)算法,求解计算迁移问题.与随机分配(random allocation, RA)算法、支持路径切换选择的(path selection with handovers, PSwH)算法在不同实验场景下对比分析,Ks-IMCO算法的能耗、延迟等明显提升,能有效提高边缘计算网络计算迁移的效率.
    Abstract: As edge computing and cloud computing develop in a rapid speed and integrate with each other, resources and services gradually offload from the core network to the edge of the network. Efficient computation offloading algorithm is one of the most important problems in mobile edge computing networks. In order to improve the performance of the algorithm, a computation offloading algorithm with path selection based on K-shell influence maximization is proposed. The K-shell method is used to grade the edge servers by applying the convertibility and maximizing influence model of similar problems. Otherwise, considering the problem of excessive load of edge servers, path overlap (PO) algorithm is constructed, and indicators such as the communication quality, interaction strength, and queue processing ability, etc. are introduced to optimize the performance of the algorithm. The offloading path problem of the optimization calculation task is transformed into the social network impact maximization problem. Based on the idea of maximizing K-shell influence, greedy and heuristic algorithms are optimized and improved, and the K-shell influence maximization computation offloading (Ks-IMCO) algorithm is proposed to solve the problem of computational offloading. Through the comparative analysis of Ks-IMCO and random allocation (RA), path selection with handovers (PSwH) algorithm experiments, the energy consumption and delay of Ks-IMCO algorithm have been significantly improved, which can effectively improve the efficiency of edge computing network computing offloading.
  • 期刊类型引用(6)

    1. 郭晓龙,牛晋宇,杜永萍. 基于树莓派的高效卷积优化方法. 计算机技术与发展. 2023(05): 96-104 . 百度学术
    2. 辛明勇,祝健杨,徐长宝,姚浩,刘德宏. 基于循环神经网络的多核处理器层次化存储技术. 电子设计工程. 2023(22): 121-124+129 . 百度学术
    3. 王利伟,玄志武,徐洪洲,刘学. Windows环境下遥测数据并行拼接处理方法研究. 电子设计工程. 2021(02): 10-15 . 百度学术
    4. 孟慧玲,王耀彬,李凌,杨洋,王欣夷,刘志勤. TACLeBench中内核程序循环级推测并行性分析. 计算机应用. 2021(09): 2652-2657 . 百度学术
    5. 于海心,王晶,李晓锋. 基于改进RMS算法的多核嵌入式系统总线周期调度表优化设计. 火炮发射与控制学报. 2021(03): 71-75 . 百度学术
    6. 丁艳,张海文,孙永彦. 基于多网格技术的电网工程造价数据信息分析方法研究. 电子设计工程. 2021(19): 35-39 . 百度学术

    其他类型引用(8)

计量
  • 文章访问数:  567
  • HTML全文浏览量:  1
  • PDF下载量:  186
  • 被引次数: 14
出版历程
  • 发布日期:  2021-08-31

目录

    /

    返回文章
    返回