Detecting Weak Points in Networks Using Variable Neighborhood Search

Recent advances in networks technology require from advanced technologies for monitoring and controlling weaknesses in networks. Networks are naturally dynamic systems to which a wide variety of devices are continuously connecting and disconnecting. This dynamic nature force us to maintain a constant analysis looking for weak points that can eventually disconnect the network. The detection of weak points is devoted to find which nodes must be reinforced in order to increase the safety of the network. This work tackles the \( \alpha \) separator problem, which aims to find a minimum set of nodes that disconnect the network in subnetworks of size smaller than a given threshold. A Variable Neighborhood Search algorithm is proposed for finding the minimum \( \alpha \) separator in different network topologies, comparing the obtained results with the best algorithm found in the state of the art.

[1]  Abraham Duarte,et al.  Efficient Greedy Randomized Adaptive Search Procedure for the Generalized Regenerator Location Problem , 2016, Int. J. Comput. Intell. Syst..

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .

[4]  J. Y. Yen.  Finding the K Shortest Loopless Paths in a Network , 1971 .

[5]  Uriel Feige,et al.  Finding small balanced separators , 2006, STOC '06.

[6]  Mirjana Cangalovic,et al.  Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search , 2003, Eur. J. Oper. Res..

[7]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[8]  Mauricio G. C. Resende,et al.  A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set , 1994, Oper. Res..

[9]  Fred W. Glover,et al.  Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization , 2015, Inf. Sci..

[10]  Massimo Marchiori,et al.  Model for cascading failures in complex networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  Christian Grothoff,et al.  Partitioning the Internet , 2012, 2012 7th International Conference on Risks and Security of Internet and Systems (CRiSIS).

[12]  I. Kamwa,et al.  Causes of the 2003 major grid blackouts in North America and Europe, and recommended means to improve system dynamic performance , 2005, IEEE Transactions on Power Systems.

[13]  P. Hansen,et al.  Variable neighbourhood search: methods and applications , 2010, Ann. Oper. Res..

[14]  R. A. Whitaker,et al.  A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems , 1983 .

[15]  Ness B. Shroff,et al.  Finding minimum node separators: A Markov chain Monte Carlo method , 2018, Reliab. Eng. Syst. Saf..

[16]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[17]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..