On Progressive Network Recovery from Massive Failures under Uncertainty

Diman Zad Tootaghaj, Novella Bartolini, Hana Khamfroush, Thomas F. La Porta

Research output: Contribution to journalArticle

Abstract

Network recovery after large-scale failures has tremendous cost implications. While numerous approaches have been proposed to restore critical services after large-scale failures, they mostly assume having full knowledge of failure location, which cannot be achieved in real failure scenarios. Making restoration decisions under uncertainty is often further complicated in a large-scale failure. This paper addresses progressive network recovery under the uncertain knowledge of damages. We formulate the problem as a mixed integer linear programming and show that it is NP-hard. We propose an iterative stochastic recovery algorithm (ISR) to recover the network in a progressive manner to satisfy the critical services. At each optimization step, we make a decision to repair a part of the network and gather more information iteratively, until critical services are completely restored. We propose three different approaches: 1) an iterative shortest path algorithm; 2) an approximate branch and bound (ISR-BB); and 3) an iterative multicommodity LP relaxation (ISR-MULT). Further, we compared our approach with the state-of-the-art centrality-based damage assessment and recovery (CeDAR) and iterative split and prune (ISP) algorithms. Our results show that ISR-BB and ISR-MULT outperform the state-of-the-art ISP and CeDAR algorithms while we can configure our choice of tradeoff between the execution time, the number of repairs (cost), and the demand loss. We show that our recovery algorithm, on average, can reduce the total number of repairs by a factor of about 3 with respect to ISP, while satisfying all critical demands.

Original languageEnglish (US)
Article number8527547
Pages (from-to)113-126
Number of pages14
JournalIEEE Transactions on Network and Service Management
Volume16
Issue number1
DOIs
StatePublished - Mar 1 2019

Fingerprint

Recovery
Repair
Uncertainty
Linear programming
Restoration
Costs

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Zad Tootaghaj, Diman ; Bartolini, Novella ; Khamfroush, Hana ; La Porta, Thomas F. / On Progressive Network Recovery from Massive Failures under Uncertainty. In: IEEE Transactions on Network and Service Management. 2019 ; Vol. 16, No. 1. pp. 113-126.
@article{5f23739a2b6f47fba75246bef693b3ca,
title = "On Progressive Network Recovery from Massive Failures under Uncertainty",
abstract = "Network recovery after large-scale failures has tremendous cost implications. While numerous approaches have been proposed to restore critical services after large-scale failures, they mostly assume having full knowledge of failure location, which cannot be achieved in real failure scenarios. Making restoration decisions under uncertainty is often further complicated in a large-scale failure. This paper addresses progressive network recovery under the uncertain knowledge of damages. We formulate the problem as a mixed integer linear programming and show that it is NP-hard. We propose an iterative stochastic recovery algorithm (ISR) to recover the network in a progressive manner to satisfy the critical services. At each optimization step, we make a decision to repair a part of the network and gather more information iteratively, until critical services are completely restored. We propose three different approaches: 1) an iterative shortest path algorithm; 2) an approximate branch and bound (ISR-BB); and 3) an iterative multicommodity LP relaxation (ISR-MULT). Further, we compared our approach with the state-of-the-art centrality-based damage assessment and recovery (CeDAR) and iterative split and prune (ISP) algorithms. Our results show that ISR-BB and ISR-MULT outperform the state-of-the-art ISP and CeDAR algorithms while we can configure our choice of tradeoff between the execution time, the number of repairs (cost), and the demand loss. We show that our recovery algorithm, on average, can reduce the total number of repairs by a factor of about 3 with respect to ISP, while satisfying all critical demands.",
author = "{Zad Tootaghaj}, Diman and Novella Bartolini and Hana Khamfroush and {La Porta}, {Thomas F.}",
year = "2019",
month = "3",
day = "1",
doi = "10.1109/TNSM.2018.2880155",
language = "English (US)",
volume = "16",
pages = "113--126",
journal = "IEEE Transactions on Network and Service Management",
issn = "1932-4537",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

On Progressive Network Recovery from Massive Failures under Uncertainty. / Zad Tootaghaj, Diman; Bartolini, Novella; Khamfroush, Hana; La Porta, Thomas F.

In: IEEE Transactions on Network and Service Management, Vol. 16, No. 1, 8527547, 01.03.2019, p. 113-126.

Research output: Contribution to journalArticle

TY - JOUR

T1 - On Progressive Network Recovery from Massive Failures under Uncertainty

AU - Zad Tootaghaj, Diman

AU - Bartolini, Novella

AU - Khamfroush, Hana

AU - La Porta, Thomas F.

PY - 2019/3/1

Y1 - 2019/3/1

N2 - Network recovery after large-scale failures has tremendous cost implications. While numerous approaches have been proposed to restore critical services after large-scale failures, they mostly assume having full knowledge of failure location, which cannot be achieved in real failure scenarios. Making restoration decisions under uncertainty is often further complicated in a large-scale failure. This paper addresses progressive network recovery under the uncertain knowledge of damages. We formulate the problem as a mixed integer linear programming and show that it is NP-hard. We propose an iterative stochastic recovery algorithm (ISR) to recover the network in a progressive manner to satisfy the critical services. At each optimization step, we make a decision to repair a part of the network and gather more information iteratively, until critical services are completely restored. We propose three different approaches: 1) an iterative shortest path algorithm; 2) an approximate branch and bound (ISR-BB); and 3) an iterative multicommodity LP relaxation (ISR-MULT). Further, we compared our approach with the state-of-the-art centrality-based damage assessment and recovery (CeDAR) and iterative split and prune (ISP) algorithms. Our results show that ISR-BB and ISR-MULT outperform the state-of-the-art ISP and CeDAR algorithms while we can configure our choice of tradeoff between the execution time, the number of repairs (cost), and the demand loss. We show that our recovery algorithm, on average, can reduce the total number of repairs by a factor of about 3 with respect to ISP, while satisfying all critical demands.

AB - Network recovery after large-scale failures has tremendous cost implications. While numerous approaches have been proposed to restore critical services after large-scale failures, they mostly assume having full knowledge of failure location, which cannot be achieved in real failure scenarios. Making restoration decisions under uncertainty is often further complicated in a large-scale failure. This paper addresses progressive network recovery under the uncertain knowledge of damages. We formulate the problem as a mixed integer linear programming and show that it is NP-hard. We propose an iterative stochastic recovery algorithm (ISR) to recover the network in a progressive manner to satisfy the critical services. At each optimization step, we make a decision to repair a part of the network and gather more information iteratively, until critical services are completely restored. We propose three different approaches: 1) an iterative shortest path algorithm; 2) an approximate branch and bound (ISR-BB); and 3) an iterative multicommodity LP relaxation (ISR-MULT). Further, we compared our approach with the state-of-the-art centrality-based damage assessment and recovery (CeDAR) and iterative split and prune (ISP) algorithms. Our results show that ISR-BB and ISR-MULT outperform the state-of-the-art ISP and CeDAR algorithms while we can configure our choice of tradeoff between the execution time, the number of repairs (cost), and the demand loss. We show that our recovery algorithm, on average, can reduce the total number of repairs by a factor of about 3 with respect to ISP, while satisfying all critical demands.

UR - http://www.scopus.com/inward/record.url?scp=85056301281&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85056301281&partnerID=8YFLogxK

U2 - 10.1109/TNSM.2018.2880155

DO - 10.1109/TNSM.2018.2880155

M3 - Article

AN - SCOPUS:85056301281

VL - 16

SP - 113

EP - 126

JO - IEEE Transactions on Network and Service Management

JF - IEEE Transactions on Network and Service Management

SN - 1932-4537

IS - 1

M1 - 8527547

ER -