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

Hui TIAN; Hao WU; Yang TIAN; Jianyang REN; Yajuan CUI; Wenbao AI; Jianhua YUAN

doi:10.11959/j.issn.1000-436x.20211100

您当前的位置：

首页 >

文章列表页 >

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

Topics: Strategic Technologies to Massive Connecting for the Future Mobile Networks | 更新时间：2024-06-05

- Recovery mechanism of large-scale damaged edge computing network in industrial Internet of things
- Journal on Communications Vol. 42, Issue 4, Pages: 89-99(2021)
- 作者机构：
  
  1. 北京邮电大学网络与交换技术国家重点实验室，北京 100876
  2. 北京邮电大学理学院，北京 100876
- 作者简介：
- 基金信息：
  
  The National Natural Science Foundation of China(62071068);The BUPT Excellent Ph.D.Students Founda-tion(CX2019108)
- DOI：10.11959/j.issn.1000-436x.20211100
  CLC： TN92
- Online First：2021-04，
  
  Published：25 April 2021
- 稿件说明：
移动端阅览
Hui TIAN, Hao WU, Yang TIAN, et al. Recovery mechanism of large-scale damaged edge computing network in industrial Internet of things[J]. Journal on Communications, 2021, 42(4): 89-99.
DOI：

Hui TIAN, Hao WU, Yang TIAN, et al. Recovery mechanism of large-scale damaged edge computing network in industrial Internet of things[J]. Journal on Communications, 2021, 42(4): 89-99. DOI： 10.11959/j.issn.1000-436x.20211100.

摘要

针对工业物联网中边缘计算网络与其余子网的相互依赖特性所导致的网络大规模级联故障问题，考虑到网络修复初期的资源有限性，提出了一种联合考量计算需求与修复开销的网络修复机制。考虑到受损网络结构（拓扑关系与链路容量）和动态特征（边缘计算节点计算需求），基于节点计算量守恒定理构建了链路修复策略集与网络计算迁移的联合分析框架。基于Benders分解算法，将原NP-hard问题转化为相互依赖的主问题与子问题，通过割平面的不断逼近，实现对原问题最优解在多项式时间内的高效探索。结合局部分支法，进一步保障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.

关键词

Keywords

references

WU H , TIAN H , NIE G F , et al . Wireless powered mobile edge computing for industrial Internet of Things systems [J ] . IEEE Access , 2020 , 8 : 101539 - 101549 .

XIE G Q , YANG K H , XU C , et al . Digital twinning based adaptive development environment for automotive cyber-physical systems [J ] . IEEE Transactions on Industrial Informatics , 2021 , PP ( 99 ): 1 .

WU H , LYU X C , TIAN H . Online optimization of wireless powered mobile-edge computing for heterogeneous industrial Internet of things [J ] . IEEE Internet of Things Journal , 2019 , 6 ( 6 ): 9880 - 9892 .

XING L D . Cascading failures in Internet of things:review and perspectives on reliability and resilience [J ] . IEEE Internet of Things Journal , 2021 , 8 ( 1 ): 44 - 64 .

PROKHORENKO V , ALI BABAR M . Architectural resilience in cloud,fog and edge systems:a survey [J ] . IEEE Access , 2020 , 8 : 28078 - 28095 .

AYOUBI S , ASSI C , CHEN Y H , et al . Restoration methods for cloud multicast virtual networks [J ] . Journal of Network and Computer Applications , 2017 , 78 : 180 - 190 .

SATRIA D , PARK D , JO M . Recovery for overloaded mobile edge computing [J ] . Future Generation Computer Systems , 2017 , 70 : 138 - 147 .

TENG R , LI H B , MIURA R . Dynamic recovery of wireless multi-hop infrastructure with the autonomous mobile base station [J ] . IEEE Access , 2016 , 4 : 627 - 638 .

LI P D , YANG X F . On dynamic recovery of cloud storage system under advanced persistent threats [J ] . IEEE Access , 2019 , 7 : 103556 - 103569 .

BAXTER G J , TIMÁR G , MENDES J F F . Targeted damage to interdependent networks [J ] . Physical Review E , 2018 , 98 ( 3 ): 032307 .

BRUMMITT C D , D'SOUZA R M , LEICHT E A . Suppressing cascades of load in interdependent networks [J ] . Proceedings of the National Academy of Sciences , 2012 , 109 ( 12 ): 680 - 689 .

MORONE F , MAKSE H A . Influence maximization in complex networks through optimal percolation [J ] . Nature , 2015 , 524 ( 7563 ): 65 - 68 .

RUDNICK H , MOCARQUER S , ANDRADE E , et al . Disaster management [J ] . IEEE Power and Energy Magazine , 2011 , 9 ( 2 ): 37 - 45 .

PUNZO G , TEWARI A , BUTANS E , et al . Engineering resilient complex systems:the necessary shift toward complexity science [J ] . IEEE Systems Journal , 2020 , 14 ( 3 ): 3865 - 3874 .

WU H , TIAN H , FAN S S , et al . Data age aware scheduling for wireless powered mobile-edge computing in industrial Internet of things [J ] . IEEE Transactions on Industrial Informatics , 2021 , 17 ( 1 ): 398 - 408 .

SMITH A M , PÓSFAI M , ROHDEN M , et al . Competitive percolation strategies for network recovery [J ] . Scientific Reports , 2019 , 9 : 11843 .

QIN J , MIAO L X . Combined simulated annealing algorithm for logistics network design problem [C ] // 2009 International Workshop on Intelligent Systems and Applications . Piscataway:IEEE Press , 2009 : 1 - 4 .

KHELIFI M , SAIDI M Y , BOUDJIT S . Genetic algorithm based model for capacitated network design problem [C ] // 2016 24th International Conference on Software,Telecommunications and Computer Networks . Piscataway:IEEE Press , 2016 : 1 - 6 .

LIAN H B . Network design problems,formulations and solutions [D ] . Richardson:The University of Texas at Dallas , 2012 .

LI D Q , ZHANG Q , ZIO E , et al . Network reliability analysis based on percolation theory [J ] . Reliability Engineering ＆ System Safety , 2015 , 142 : 556 - 562 .

LYU X C , REN C S , NI W , et al . Distributed optimization of collaborative regions in large-scale inhomogeneous fog computing [J ] . IEEE Journal on Selected Areas in Communications , 2018 , 36 ( 3 ): 574 - 586 .

ZHAO P T , TIAN H , QIN C , et al . Energy-saving offloading by jointly allocating radio and computational resources for mobile edge computing [J ] . IEEE Access , 2017 , 5 : 11255 - 11268 .

ZHAO P T , TIAN H , CHEN K C , et al . Context-aware TDD configuration and resource allocation for mobile edge computing [J ] . IEEE Transactions on Communications , 2020 , 68 ( 2 ): 1118 - 1131 .

CODATO G , FISCHETTI M . Combinatorial Benders' cuts for mixedinteger linear programming [J ] . Operations Research , 2006 , 54 ( 4 ): 756 - 766 .

RAHMANIANI R , CRAINIC T G , GENDREAU M , et al . The Benders decomposition algorithm:a literature review [J ] . European Journal of Operational Research , 2017 , 259 ( 3 ): 801 - 817 .

WU H , TIAN H , NIE G F . Energy-efficient inter-frequency small cell discovery in dense urban environments [J ] . IEEE Wireless Communications Letters , 2019 , 8 ( 1 ): 41 - 44 .

F PEREIRA M V , V G PINTO L M , F CUNHA S H , et al . A decomposition approach to automated generation/transmission expansion planning [J ] . IEEE Transactions on Power Apparatus and Systems , 1985 , 104 ( 11 ): 3074 - 3083 .

ERICKSON J . Algorithms [M ] . Illinois : Independently Published , 2019 .

OLIVEIRA F , GROSSMANN I E , HAMACHER S . Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain [J ] . Computers ＆ Operations Research , 2014 , 49 : 47 - 58 .

运筹学教材编写组 . 运筹学:本科版 [M ] . 第4版.北京 : 清华大学出版社 , 2013 .

Textbook Compilation Team . Operations research [M ] . Beijing : Tsinghua University Press , 2013 .

FISCHETTI M , LODI A . Local branching [J ] . Mathematical Programming , 2003 , 98 ( 1/2/3 ): 23 - 47 .

SANTOSO T , AHMED S , GOETSCHALCKX M , et al . A stochastic programming approach for supply chain network design under uncertainty [J ] . European Journal of Operational Research , 2005 , 167 ( 1 ): 96 - 115 .

YU A Q , WANG N , WU N . Scale-free networks:characteristics of the time-variant robustness and vulnerability [J ] . IEEE Systems Journal , 2020 , PP ( 99 ): 1 - 11 .

Views

2295

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Privacy-preserving scheme multi-party cooperative cache sharing based on PSI in edge computing scenario

Microservice selection approach for mobile users in edge computing environment

Optimization method for data processing in digital twin-enabled computing power network for industrial production

Uncertain edge coalition game based EIP revenue estimation strategy

Efficient unpaired data validation and aggregation protocol in industrial Internet of things

Related Author

LAI Chengzhe

YANG Ting

QIN Baodong

CAO Jin

ZHAO Shuxu

JIANG Kaijun

WANG Xiaolong

WU Shuang

Related Institution

School of Cyberspace Security, Xi’an University of Posts and Telecommunications

School of Cyber Engineering, Xidian University

School for Electronic and Information Engineering, Lanzhou Jiaotong University

Purple Mountain Laboratories

School of Electronic and Information Engineering, Lanzhou Jiaotong University

AI问答

⁰