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.
KeywordsAlpha-separator Reduced VNS Betweenness
- 6.Feige, U., Mahdian, M.: Finding small balanced separators. In: Kleinberg, J.M. (ed.) STOC, pp. 375–384. ACM (2006)Google Scholar
- 13.Lee, J., Kwak, J., Lee, H.W., Shroff, N.B.: Finding minimum node separators: a Markov chain Monte Carlo method. In: 13th International Conference on Design of Reliable Communication Networks, DRCN 2017, pp. 1–8, March 2017Google Scholar
- 15.Mohamed-Sidi, M.: K-separator problem. (Problème de k-Sèparateur). Ph.D. thesis, Telecom & Management SudParis, Èvry, Essonne, France (2014)Google Scholar
- 17.Wachs, M., Grothoff, C., Thurimella, R.: Partitioning the internet. In: Martinelli, F., Lanet, J.L., Fitzgerald, W.M., Foley, S.N. (eds.) CRiSIS, pp. 1–8. IEEE Computer Society (2012)Google Scholar