通信学报 ›› 2021, Vol. 42 ›› Issue (4): 89-99.doi: 10.11959/j.issn.1000-436x.20211100

所属专题: 边缘计算

• 专题:面向未来移动网络的大规模组网关键技术 • 上一篇    下一篇

工业物联网中大规模受损边缘计算网络修复机制

田辉1, 伍浩1, 田洋1, 任建阳1, 崔亚娟1, 艾文宝2, 袁健华2   

  1. 1 北京邮电大学网络与交换技术国家重点实验室,北京 100876
    2 北京邮电大学理学院,北京 100876
  • 修回日期:2021-04-08 出版日期:2021-04-25 发布日期:2021-04-01
  • 作者简介:田辉(1963- ),女,河南郑州人,博士,北京邮电大学教授、博士生导师,主要研究方向为无线资源管理、智能边缘计算、移动社交网络。
    伍浩(1994- ),男,江西新余人,北京邮电大学博士生,主要研究方向为工业物联网、无线资源管理、网络弹性、移动边缘计算、复杂网络。
    田洋(1991- ),男,河南郑州人,北京邮电大学博士生,主要研究方向为大数据环境下的链路预测、复杂网络上的传播动力学等。
    任建阳(1997- ),男,北京人,北京邮电大学硕士生,主要研究方向为边缘计算、无线资源管理等。
    崔亚娟(1991- ),女,河南平顶山人,北京邮电大学博士生,主要研究方向为无人机网络、车联网、移动自组织网络等。
    艾文宝(1962- ),男,江西高安人,博士,北京邮电大学教授、博士生导师,主要研究方向为最优化理论和算法及其应用。
    袁健华(1979- ),女,湖南郴州人,博士,北京邮电大学教授、博士生导师,主要研究方向为最优化理论和算法、有限元方法及其工程应用。
  • 基金资助:
    国家自然科学基金资助项目(62071068);北京邮电大学优秀博士生创新基金资助项目(CX2019108)

Recovery mechanism of large-scale damaged edge computing network in industrial Internet of things

Hui TIAN1, Hao WU1, Yang TIAN1, Jianyang REN1, Yajuan CUI1, Wenbao AI2, Jianhua YUAN2   

  1. 1 State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China
    2 School of Sciences, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • Revised:2021-04-08 Online:2021-04-25 Published:2021-04-01
  • Supported by:
    The National Natural Science Foundation of China(62071068);The BUPT Excellent Ph.D.Students Founda-tion(CX2019108)

摘要:

针对工业物联网中边缘计算网络与其余子网的相互依赖特性所导致的网络大规模级联故障问题,考虑到网络修复初期的资源有限性,提出了一种联合考量计算需求与修复开销的网络修复机制。考虑到受损网络结构(拓扑关系与链路容量)和动态特征(边缘计算节点计算需求),基于节点计算量守恒定理构建了链路修复策略集与网络计算迁移的联合分析框架。基于Benders分解算法,将原NP-hard问题转化为相互依赖的主问题与子问题,通过割平面的不断逼近,实现对原问题最优解在多项式时间内的高效探索。结合局部分支法,进一步保障Benders分解算法的上界在迭代过程中的非增特性,加快算法收敛速度。仿真结果表明,所提算法的系统总开销性能优于传统基于拓扑结构的修复算法,并且可以在多场景下保持其性能优势。

关键词: 工业物联网, 边缘计算, 网络修复, Benders分解算法, 局部分支法

Abstract:

Given the limited resources at early stages for recovery, a failure recovery mechanism of the edge computing network considering both computational demands and repair costs was proposed, which intends to tackle the problem of the high probability of large-scale cascading failure caused by the interdependence between the edge computing network and other subnetworks in industrial Internet of things (IIoT).Considering the network structure (topology and link capacity) and network dynamics (computational demands), a joint link recovery selection and computation migration optimization problem was formulated under the conservation of node computing requirements.By leveraging the Benders decomposition algorithm, the NP-hard problem was transformed into a main problem and a sub-problem, which were interdependent and could be solved in polynomial time through the approximation of cutting planes.A local branching method was further introduced to guarantee the non-increasing nature of the Benders upper bound, thus accelerating the convergence of Benders decomposition.Simulation results demonstrate that the proposed algorithm outperforms the conventional topology-based recovery algorithm in system utility, and can perform well in multiple scenarios.

Key words: industrial Internet of things, edge computing, network recovery, Benders decomposition algorithm, local branching

中图分类号: 

No Suggested Reading articles found!