標題: | Graph Algorithms for Preventing Cascading Failures in Networks |
作者: | Yu, Pei Duo Tan, Chee Wei Fu, Hung-Lin 交大名義發表 National Chiao Tung University |
關鍵字: | Cascading failure;viral spreading;graph theory;large-scale optimization;message-passing algorithms |
公開日期: | 1-一月-2018 |
摘要: | Cascading failures in critical networked infrastructures that result even from a single source of failure often lead to rapidly widespread outages as witnessed in the 2013 Northeast blackout in northern America. This paper examines the problem of minimizing the outage when a cascading failure from a single source occurs. An optimization problem is formulated where a limited number of protection nodes, when placed strategically in the network to mitigate systemic risk, can minimize the spread of cascading failure. Computationally fast distributed message-passing algorithms are developed to solve this problem. Global convergence and the optimality of the algorithm are proved using graph theoretic analysis. In particular, we illustrate how the poset-constrained graph algorithms can be designed to address the trade-off between complexity and optimality. |
URI: | http://hdl.handle.net/11536/146182 |
期刊: | 2018 52ND ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS (CISS) |
顯示於類別: | 會議論文 |