A memetic algorithm for enhancing the robustness of scale-free networks against malicious attacks

Abstract The robustness of the infrastructure of various real-life systems, which can be represented by networks and manifests the scale-free property, is of great importance. Thus, in this paper, a new memetic algorithm (MA), which is a type of effective optimization method combining both global and local searches, is proposed to enhance the robustness of scale-free (RSF) networks against malicious attacks (MA) without changing the degree distribution. The proposed algorithm is abbreviated as MA–RSF MA . Especially, with the intrinsic properties of the problem of optimizing network structure in mind, a crossover operator which can perform global search and a local search operator are designed. In the experiments, both synthetic scale-free networks and real-world networks, like the EU power grid network and the real Internet at the level of autonomous system (AS), are used. MA–RSF MA shows a strong ability in searching for the most robust network structure, and clearly outperforms existing local search methods.

[1]  Hiroki Sayama,et al.  Optimization of robustness and connectivity in complex networks. , 2003, Physical review letters.

[2]  Beom Jun Kim,et al.  Attack vulnerability of complex networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Abhijit Sarkar,et al.  Two-peak and three-peak optimal complex networks. , 2004, Physical review letters.

[4]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[5]  Zexuan Zhu,et al.  Wrapper–Filter Feature Selection Algorithm Using a Memetic Framework , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[6]  P. Holme,et al.  Exploring the assortativity-clustering space of a network's degree sequence. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  Regina Berretta,et al.  Benchmarking a memetic algorithm for ordering microarray data , 2007, Biosyst..

[8]  D S Callaway,et al.  Network robustness and fragility: percolation on random graphs. , 2000, Physical review letters.

[9]  Shi Xiao,et al.  Robustness of scale-free networks under rewiring operations , 2010 .

[10]  Howard A. Stone,et al.  2-Peak and 3-Peak Optimal Complex Networks , 2004 .

[11]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[12]  Mauricio Barahona,et al.  Spectral Measure of Structural Robustness in Complex Networks , 2011, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[13]  Hans J. Herrmann,et al.  Onion-like network topology enhances robustness against malicious attacks , 2011 .

[14]  Marco Tomassini,et al.  Optimizing the Robustness of Scale-Free Networks with Simulated Annealing , 2011, ICANNGA.

[15]  S. Havlin,et al.  Optimization of network robustness to waves of targeted and random attacks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  Shi Zhou,et al.  The rich-club phenomenon in the Internet topology , 2003, IEEE Communications Letters.

[17]  Cohen,et al.  Resilience of the internet to random breakdowns , 2000, Physical review letters.

[18]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[19]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[20]  Albert-László Barabási,et al.  Error and attack tolerance of complex networks , 2000, Nature.

[21]  James Smith,et al.  A tutorial for competent memetic algorithms: model, taxonomy, and design issues , 2005, IEEE Transactions on Evolutionary Computation.

[22]  Janusz W. Bialek,et al.  Updated and validated power flow model of the main continental European transmission network , 2013, 2013 IEEE Grenoble Conference.

[23]  Harry Eugene Stanley,et al.  Robustness of onion-like correlated networks against targeted attacks , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[24]  André A Moreira,et al.  Biased percolation on scale-free networks. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[25]  Andy J. Keane,et al.  Meta-Lamarckian learning in memetic algorithms , 2004, IEEE Transactions on Evolutionary Computation.

[26]  Abdullah Al Mamun,et al.  Balancing exploration and exploitation with adaptive variation for evolutionary multi-objective optimization , 2009, Eur. J. Oper. Res..

[27]  S. Havlin,et al.  Breakdown of the internet under intentional attack. , 2000, Physical review letters.

[28]  H. Herrmann,et al.  How to Make a Fragile Network Robust and Vice Versa , 2009, Physical review letters.

[29]  Yew-Soon Ong,et al.  Memetic Computation—Past, Present & Future [Research Frontier] , 2010, IEEE Computational Intelligence Magazine.

[30]  L. A. Nunes Amaral,et al.  Extremum statistics in scale-free network models. , 2002, Physical review letters.

[31]  Yew-Soon Ong,et al.  A Probabilistic Memetic Framework , 2009, IEEE Transactions on Evolutionary Computation.

[32]  V Latora,et al.  Efficient behavior of small-world networks. , 2001, Physical review letters.

[33]  Janusz Bialek,et al.  Approximate model of European interconnected system as a benchmark system to study effects of cross-border trades , 2005 .

[34]  Hans J. Herrmann,et al.  Mitigation of malicious attacks on networks , 2011, Proceedings of the National Academy of Sciences.

[35]  Ernesto Estrada,et al.  Network robustness to targeted attacks. The interplay of expansibility and degree distribution , 2006 .

[36]  Marco Tomassini,et al.  Smart Rewiring for Network Robustness , 2013, J. Complex Networks.