Error Correction Coding Meets Cyber-Physical Systems: Message-Passing Analysis of Self-Healing Interdependent Networks

Abstract

Abstract-Coupling cyber and physical systems gives rise to numerous engineering challenges and opportunities. An important challenge is the contagion of failure from one system to another, which can lead to large-scale cascading failures. However, the self-healing ability emerges as a valuable opportunity where the overlaying cyber network can cure failures in the underlying physical network. To capture both self-healing and contagion, this paper considers a graphical model representation of an interdependent cyber-physical system, in which nodes represent various cyber or physical functionalities, and edges capture the interactions between the nodes. A message-passing algorithm is proposed for this representation to study the dynamics of failure propagation and healing. By conducting a density evolution analysis for this algorithm, network reaction to initial disruptions is investigated. It is proved that as the number of message-passing iterations increases, the network reaches a steady-state condition that would be either a complete healing or a complete collapse. Then, a sufficient condition is derived to select the network parameters to guarantee the complete healing of the system. The result of the density evolution analysis is further employed to jointly optimize the design of cyber and physical networks for maximum resiliency. This analytical framework is then extended to the cases where propagation of failures in the physical network is faster than the healing responses of the cyber network. Such scenarios are of interest in many real-life applications such as smart grid. Finally, extensive numerical results are presented to verify the analysis and investigate the impact of the network parameters on the resiliency of the network.

Attribute Relationship Solving Method Based on Nodes and Communities in Opportunistic Social Networks

“…In the experiment, we adopt real network data sets to comprehensively evaluate the performance of the proposed algorithm. To compare the advantages and disadvantages of RRMNC, this study compares and analyses with three algorithms: the Agent Unsigned Network [28], SAC [29]and BAGC [30]. In the experiment, the tool used for execution is NS-3.…”

“…The node stores the information to be transmitted in its own cache area, carries the information for movement, and does not send the information to the node until it meets the appropriate node. In the urban social scene, people with portable communication equipment represent nodes in the social opportunistic network, so the social attributes of these people will have a great impact on the data transmission strategy [25][26][27][28][29][30][31][32]. Data generated by human behaviors are of great significance for the selection and improvement of information transmission strategies, so they have become the research hotspot of social opportunistic networks.…”

Power Allocation for D2D Communications Using Max-Min Message-Passing Algorithm

“…For this purpose, a graphical representation of functions and exchanged messages helps to visualize the general model of the network and to implement the MP algorithm [35]. Among graphical models, FGs work efficiently for decomposition of complex problems [24], [36]. An FG is basically a bipartite graph composed of variable nodes and factor nodes.…”

DeepPR: Incremental Recovery for Interdependent VNFs with Deep Reinforcement Learning

“…The works in [12], [13], [14] analyze the behaviors of failure propagations in such interdependent networks when each node performs local recovery (healing), where a functioning node substitutes for the failed node by establishing new connections with its neighbors.…”