Evaluating local disaster recovery strategies
Jorik Oostenbrink (TU Delft - Electrical Engineering, Mathematics and Computer Science)
Fernando A. Kuipers (TU Delft - Electrical Engineering, Mathematics and Computer Science)
Bjarne E. Helvik (Norwegian University of Science and Technology (NTNU))
Poul E. Heegaard (Norwegian University of Science and Technology (NTNU))
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
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.