Network Recovery From Massive Failures Under Uncertain Knowledge Of Damages
2017 IFIP NETWORKING CONFERENCE (IFIP NETWORKING) AND WORKSHOPS(2017)
摘要
This paper addresses progressive network recovery under uncertain knowledge of damages. We formulate the problem as a mixed integer linear programming (MILP), 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. Three different algorithms are used to find a feasible set and determine which node to repair, namely, 1) an iterative shortest path algorithm (ISR-SRT), 2) an approximate branch and bound (ISR-BB) and 3) an iterative multi-commodity LP relaxation (ISR-MULT). Further, we have modified the state-of-the-art iterative split and prune (ISP) algorithm to incorporate the uncertain failures. Our results show that ISR-BB and ISR-MULT outperform the state-of-the-art "progressive ISP" algorithm while we can configure our choice of trade-off between the execution time, 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.
更多查看译文
关键词
ISR-MULT,ISR-BB,progressive network recovery,mixed integer linear programming,iterative stochastic recovery algorithm,iterative shortest path algorithm,ISR-SRT,iterative multicommodity LP relaxation,NP-Hard problem,approximate branch and bound,MILP,iterative split and prune algorithm,ISP algorithm
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要