skip to main content

DOE PAGESDOE PAGES

Title: Best effort broadcast under cascading failures in interdependent critical infrastructure networks

Here, we present a novel study of reliable broadcast in interdependent networks, in which the failures in one network may cascade to another network. In particular, we focus on the interdependency between a communication network and a power grid network, where the power grid depends on the communication network for control and the communication network depends on the grid for power. In this paper, we propose a best effort broadcast algorithm to handle crash failures in the communication network that may cause cascading failures. We guarantee that all the correct nodes, which operate correctly according to the protocol and do not experience any software or hardware or network failures, eventually deliver the message if the sender is correct. We provide a centralized algorithm and a fully distributed algorithm for nodes to analyze and handle cascading failures. At the core of our work is the fully distributed algorithm which enjoys great performance and scalability. Our evaluation results show that the algorithm handles cascading failures with low overhead.
Authors:
 [1] ; ORCiD logo [2] ; ORCiD logo [2] ; ORCiD logo [2]
  1. Univ. of Maryland Baltimore County (UMBC), Baltimore, MD (United States)
  2. Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
Publication Date:
Grant/Contract Number:
AC05-00OR22725
Type:
Accepted Manuscript
Journal Name:
Pervasive and Mobile Computing
Additional Journal Information:
Journal Volume: 43; Journal Issue: C; Journal ID: ISSN 1574-1192
Publisher:
Elsevier
Research Org:
Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
Sponsoring Org:
USDOE
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICS AND COMPUTING; Interdependent networks; Best effort reliable broadcast; Cascading failures; Crash failures; Soft links
OSTI Identifier:
1468230

Duan, Sisi, Lee, Sangkeun, Chinthavali, Supriya, and Shankar, Mallikarjun. Best effort broadcast under cascading failures in interdependent critical infrastructure networks. United States: N. p., Web. doi:10.1016/j.pmcj.2017.12.006.
Duan, Sisi, Lee, Sangkeun, Chinthavali, Supriya, & Shankar, Mallikarjun. Best effort broadcast under cascading failures in interdependent critical infrastructure networks. United States. doi:10.1016/j.pmcj.2017.12.006.
Duan, Sisi, Lee, Sangkeun, Chinthavali, Supriya, and Shankar, Mallikarjun. 2017. "Best effort broadcast under cascading failures in interdependent critical infrastructure networks". United States. doi:10.1016/j.pmcj.2017.12.006. https://www.osti.gov/servlets/purl/1468230.
@article{osti_1468230,
title = {Best effort broadcast under cascading failures in interdependent critical infrastructure networks},
author = {Duan, Sisi and Lee, Sangkeun and Chinthavali, Supriya and Shankar, Mallikarjun},
abstractNote = {Here, we present a novel study of reliable broadcast in interdependent networks, in which the failures in one network may cascade to another network. In particular, we focus on the interdependency between a communication network and a power grid network, where the power grid depends on the communication network for control and the communication network depends on the grid for power. In this paper, we propose a best effort broadcast algorithm to handle crash failures in the communication network that may cause cascading failures. We guarantee that all the correct nodes, which operate correctly according to the protocol and do not experience any software or hardware or network failures, eventually deliver the message if the sender is correct. We provide a centralized algorithm and a fully distributed algorithm for nodes to analyze and handle cascading failures. At the core of our work is the fully distributed algorithm which enjoys great performance and scalability. Our evaluation results show that the algorithm handles cascading failures with low overhead.},
doi = {10.1016/j.pmcj.2017.12.006},
journal = {Pervasive and Mobile Computing},
number = C,
volume = 43,
place = {United States},
year = {2017},
month = {12}
}