Network recovery after massive failures

Novella Bartolini, Stefano Ciavarella, Thomas F.La Porta, Simone Silvestri

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Citations (Scopus)

Abstract

This paper addresses the problem of efficientlyrestoring sufficient resources in a communications network tosupport the demand of mission critical services after a large scaledisruption. We give a formulation of the problem as an MILPand show that it is NP-hard. We propose a polynomial timeheuristic, called Iterative Split and Prune (ISP) that decomposesthe original problem recursively into smaller problems, untilit determines the set of network components to be restored. We performed extensive simulations by varying the topologies, the demand intensity, the number of critical services, and thedisruption model. Compared to several greedy approaches ISPperforms better in terms of number of repaired components, and does not result in any demand loss. It performs very close tothe optimal when the demand is low with respect to the supplynetwork capacities, thanks to the ability of the algorithm tomaximize sharing of repaired resources.

Original languageEnglish (US)
Title of host publicationProceedings - 46th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, DSN 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages97-108
Number of pages12
ISBN (Electronic)9781467388917
DOIs
StatePublished - Sep 29 2016
Event46th IEEE/IFIP International Conference on Dependable Systems and Networks, DSN 2016 - Toulouse, France
Duration: Jun 28 2016Jul 1 2016

Publication series

NameProceedings - 46th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, DSN 2016

Other

Other46th IEEE/IFIP International Conference on Dependable Systems and Networks, DSN 2016
CountryFrance
CityToulouse
Period6/28/167/1/16

Fingerprint

Network components
Telecommunication networks
Topology
Polynomials
Recovery

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Software
  • Safety, Risk, Reliability and Quality
  • Computer Networks and Communications

Cite this

Bartolini, N., Ciavarella, S., Porta, T. F. L., & Silvestri, S. (2016). Network recovery after massive failures. In Proceedings - 46th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, DSN 2016 (pp. 97-108). [7579733] (Proceedings - 46th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, DSN 2016). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/DSN.2016.18
Bartolini, Novella ; Ciavarella, Stefano ; Porta, Thomas F.La ; Silvestri, Simone. / Network recovery after massive failures. Proceedings - 46th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, DSN 2016. Institute of Electrical and Electronics Engineers Inc., 2016. pp. 97-108 (Proceedings - 46th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, DSN 2016).
@inproceedings{4f7c69e2bb1449beb903ba920ab04473,
title = "Network recovery after massive failures",
abstract = "This paper addresses the problem of efficientlyrestoring sufficient resources in a communications network tosupport the demand of mission critical services after a large scaledisruption. We give a formulation of the problem as an MILPand show that it is NP-hard. We propose a polynomial timeheuristic, called Iterative Split and Prune (ISP) that decomposesthe original problem recursively into smaller problems, untilit determines the set of network components to be restored. We performed extensive simulations by varying the topologies, the demand intensity, the number of critical services, and thedisruption model. Compared to several greedy approaches ISPperforms better in terms of number of repaired components, and does not result in any demand loss. It performs very close tothe optimal when the demand is low with respect to the supplynetwork capacities, thanks to the ability of the algorithm tomaximize sharing of repaired resources.",
author = "Novella Bartolini and Stefano Ciavarella and Porta, {Thomas F.La} and Simone Silvestri",
year = "2016",
month = "9",
day = "29",
doi = "10.1109/DSN.2016.18",
language = "English (US)",
series = "Proceedings - 46th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, DSN 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "97--108",
booktitle = "Proceedings - 46th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, DSN 2016",
address = "United States",

}

Bartolini, N, Ciavarella, S, Porta, TFL & Silvestri, S 2016, Network recovery after massive failures. in Proceedings - 46th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, DSN 2016., 7579733, Proceedings - 46th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, DSN 2016, Institute of Electrical and Electronics Engineers Inc., pp. 97-108, 46th IEEE/IFIP International Conference on Dependable Systems and Networks, DSN 2016, Toulouse, France, 6/28/16. https://doi.org/10.1109/DSN.2016.18

Network recovery after massive failures. / Bartolini, Novella; Ciavarella, Stefano; Porta, Thomas F.La; Silvestri, Simone.

Proceedings - 46th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, DSN 2016. Institute of Electrical and Electronics Engineers Inc., 2016. p. 97-108 7579733 (Proceedings - 46th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, DSN 2016).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Network recovery after massive failures

AU - Bartolini, Novella

AU - Ciavarella, Stefano

AU - Porta, Thomas F.La

AU - Silvestri, Simone

PY - 2016/9/29

Y1 - 2016/9/29

N2 - This paper addresses the problem of efficientlyrestoring sufficient resources in a communications network tosupport the demand of mission critical services after a large scaledisruption. We give a formulation of the problem as an MILPand show that it is NP-hard. We propose a polynomial timeheuristic, called Iterative Split and Prune (ISP) that decomposesthe original problem recursively into smaller problems, untilit determines the set of network components to be restored. We performed extensive simulations by varying the topologies, the demand intensity, the number of critical services, and thedisruption model. Compared to several greedy approaches ISPperforms better in terms of number of repaired components, and does not result in any demand loss. It performs very close tothe optimal when the demand is low with respect to the supplynetwork capacities, thanks to the ability of the algorithm tomaximize sharing of repaired resources.

AB - This paper addresses the problem of efficientlyrestoring sufficient resources in a communications network tosupport the demand of mission critical services after a large scaledisruption. We give a formulation of the problem as an MILPand show that it is NP-hard. We propose a polynomial timeheuristic, called Iterative Split and Prune (ISP) that decomposesthe original problem recursively into smaller problems, untilit determines the set of network components to be restored. We performed extensive simulations by varying the topologies, the demand intensity, the number of critical services, and thedisruption model. Compared to several greedy approaches ISPperforms better in terms of number of repaired components, and does not result in any demand loss. It performs very close tothe optimal when the demand is low with respect to the supplynetwork capacities, thanks to the ability of the algorithm tomaximize sharing of repaired resources.

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

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

U2 - 10.1109/DSN.2016.18

DO - 10.1109/DSN.2016.18

M3 - Conference contribution

AN - SCOPUS:84994311385

T3 - Proceedings - 46th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, DSN 2016

SP - 97

EP - 108

BT - Proceedings - 46th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, DSN 2016

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Bartolini N, Ciavarella S, Porta TFL, Silvestri S. Network recovery after massive failures. In Proceedings - 46th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, DSN 2016. Institute of Electrical and Electronics Engineers Inc. 2016. p. 97-108. 7579733. (Proceedings - 46th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, DSN 2016). https://doi.org/10.1109/DSN.2016.18