Abstract
It is of vital importance to maintain at least some network functionality after a disaster, for example by temporarily replacing damaged nodes by emergency nodes. We propose a framework to evaluate dierent node replacement strategies, based on a large set of representative disasters. We prove that computing the optimal choice of nodes to replace is an NP-hard problem and propose several simple strategies. We evaluate these strategies on two U.S. topologies and show that a simple greedy strategy can perform close to optimal.
Original language | English |
---|---|
Pages (from-to) | 62-66 |
Number of pages | 5 |
Journal | Performance Evaluation Review |
Volume | 46 |
Issue number | 2 |
DOIs | |
State | Published - 17 Jan 2019 |
Externally published | Yes |
Event | 2018 Workshop on MAthematical Performance Modeling and Analysis, MAMA 2018 and Workshop on Critical Infrastructure Network Security, CINS 2018 - Irvine, United States Duration: 1 Jun 2018 → … |