Efficient Detection of Critical Links to Maintain Performance of Network with Uncertain Connectivity

We address the problem of efficiently detecting critical links in a large network in order to maintain network performance, e.g., in case of disaster evacuation, for which a probabilistic link disconnection model plays an essential role. Here, critical links are such links that their disconnection exerts substantial effects on the network performance such as the average node reachability. We tackle this problem by proposing a new method consisting of two new acceleration techniques: reachability condition skipping (RCS) and distance constraints skipping (DCS). We tested the effectiveness of the proposed method by using three real-world spatial networks. In particular, we show that the proposed method achieves the efficiency gain of around \(10^4\) compared with a naive method in which every single link is blindly tested as a critical link candidate.

[1]  Nam P. Nguyen,et al.  On the Discovery of Critical Links and Nodes for Assessing Network Vulnerability , 2013, IEEE/ACM Transactions on Networking.

[2]  John Skvoretz,et al.  Node centrality in weighted networks: Generalizing degree and shortest paths , 2010, Soc. Networks.

[3]  Licinio da Silva Portugal,et al.  Determining Critical Links in a Road Network: Vulnerability and Congestion Indicators☆ , 2014 .

[4]  Masahiro Kimura,et al.  Blocking links to minimize contamination spread in a social network , 2009, TKDD.

[5]  Masahiro Kimura,et al.  Accelerating Computation of Distance Based Centrality Measures for Spatial Networks , 2016, DS.

[6]  Edith Cohen,et al.  Sketch-based Influence Maximization and Computation: Scaling up with Guarantees , 2014, CIKM.

[7]  Masahiro Kimura,et al.  An Accurate and Efficient Method to Detect Critical Links to Maintain Information Flow in Network , 2017, ISMIS.

[8]  Christian Borgs,et al.  Maximizing Social Influence in Nearly Optimal Time , 2012, SODA.

[9]  Masahiro Kimura,et al.  Detecting Critical Links in Complex Network to Maintain Information Flow/Reachability , 2016, PRICAI.

[10]  Kerstin Burckhart,et al.  An Interpretation of the Recent Evolution of the City of Barcelona through the Traffic Maps , 2012 .

[11]  Masahiro Kimura,et al.  Maximizing Network Performance Based on Group Centrality by Creating Most Effective k-Links , 2017, 2017 IEEE International Conference on Data Science and Advanced Analytics (DSAA).

[12]  Manos Papagelis,et al.  Refining Social Graph Connectivity via Shortcut Edge Addition , 2015, ACM Trans. Knowl. Discov. Data.

[13]  Evaggelia Pitoura,et al.  Centrality-Aware Link Recommendations , 2016, WSDM.

[14]  V. Latora,et al.  Centrality measures in spatial networks of urban streets. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.