Name
Abstract | ||
|---|---|---|
This paper addresses the problem of efficiently restoring sufficient resources in a communications network to support the demand of mission critical services after a large scale disruption. We give a formulation of the problem as an MILP and show that it is NP-hard. We propose a polynomial time heuristic, called Iterative Split and Prune (ISP) that decomposes the original problem recursively into smaller problems, until it 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 the disruption model. Compared to several greedy approaches ISP performs better in terms of number of repaired components, and does not result in any demand loss. It performs very close to the optimal when the demand is low with respect to the supply network capacities, thanks to the ability of the algorithm to maximize sharing of repaired resources. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/DSN.2016.18 | 2016 46th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) |
Keywords | Field | DocType |
Network recovery,flow restoration,massive network disruption | Telecommunications network,Polynomial,Computer science,Network architecture,Real-time computing,Network topology,Network recovery,Mission critical,Maintenance engineering,Recursion,Distributed computing | Conference |
ISBN | Citations | PageRank |
978-1-4673-8892-4 | 3 | 0.45 |
References | Authors | |
13 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Novella Bartolini | 1 | 250 | 21.87 |
| Stefano Ciavarella | 2 | 15 | 1.98 |
| Thomas F. La Porta | 3 | 9 | 1.92 |
| S. Silvestri | 4 | 275 | 29.61 |