Online Failure Diagnosis in Interdependent Networks

Davood Shiri,Vahid Akbari

doi:10.1007/s43069-021-00055-2

Davood Shiri, Vahid Akbari

Open Access

https://doi.org/10.1007/s43069-021-00055-2

Copy DOI

Abstract

In interdependent networks, nodes are connected to each other with respect to their failure dependency relations. As a result of this dependency, a failure in one of the nodes of one of the networks within a system of several interdependent networks can cause the failure of the entire system. Diagnosing the initial source of the failure in a collapsed system of interdependent networks is an important problem to be addressed. We study an online failure diagnosis problem defined on a collapsed system of interdependent networks where the source of the failure is at an unknown node (v). In this problem, each node of the system has a positive inspection cost and the source of the failure is diagnosed when v is inspected. The objective is to provide an online algorithm which considers dependency relations between nodes and diagnoses v with minimum total inspection cost. We address this problem from worst-case competitive analysis perspective for the first time. In this approach, solutions which are provided under incomplete information are compared with the best solution that is provided in presence of complete information using the competitive ratio (CR) notion. We give a lower bound of the CR for deterministic online algorithms and prove its tightness by providing an optimal deterministic online algorithm. Furthermore, we provide a lower bound on the expected CR of randomized online algorithms and prove its tightness by presenting an optimal randomized online algorithm. We prove that randomized algorithms are able to obtain better CR compared to deterministic algorithms in the expected sense for this online problem.

Highlights

Muro et al [16] provided an extensive study of the recovery of interdependent networks
We studied a post-failure problem defined on a system of interdependent networks where nodes are linked to each other with respect to their failure dependency relations
We proposed a lower bound on the competitive ratio of online algorithms with a deterministic nature and proved that our lower bound is tight

Summary

Introduction

Muro et al [16] provided an extensive study of the recovery of interdependent networks. As a result of such events and observations, recent studies addressing failures in network analysis problems aim to identify scenarios that might result in system failures and focus on cascading failures in a collection of networks with interdependency relations [9]. Within a competitive analysis framework, the performance of an online algorithm is assessed by comparing its results with the offline optimal solution. Page 3 of 14 10 solution to the offline problem In this approach, an analysis of the worst-case performance is provided and no probabilistic knowledge of future events is required in advance. The expected CR of a randomized algorithm on a problem is equivalent to the maximum fraction obtained from dividing the expected objective function value of the online algorithm to the optimal objective value of the offline variation considering the entire set of problem instances

Problem Definition

Literature Review

10 Page 4 of 14

Related Studies on Interdependent Networks