A Two-Phase Multiobjective Evolutionary Algorithm for Enhancing the Robustness of Scale-Free Networks Against Multiple Malicious Attacks

Designing robust networks has attracted increasing attentions in recent years. Most existing work focuses on improving the robustness of networks against a specific type of attacks. However, networks which are robust against one type of attacks may not be robust against another type of attacks. In the real-world situations, different types of attacks may happen simultaneously. Therefore, we use the Pearson's correlation coefficient to analyze the correlation between different types of attacks, model the robustness measures against different types of attacks which are negatively correlated as objectives, and model the problem of optimizing the robustness of networks against multiple malicious attacks as a multiobjective optimization problem. Furthermore, to effectively solve this problem, we propose a two-phase multiobjective evolutionary algorithm, labeled as MOEA-RSFMMA. In MOEA-RSFMMA, a single-objective sampling phase is first used to generate a good initial population for the later two-objective optimization phase. Such a two-phase optimizing pattern well balances the computational cost of the two objectives and improves the search efficiency. In the experiments, both synthetic scale-free networks and real-world networks are used to validate the performance of MOEA-RSFMMA. Moreover, both local and global characteristics of networks in different parts of the obtained Pareto fronts are studied. The results show that the networks in different parts of Pareto fronts reflect different properties, and provide various choices for decision makers.

[1]  Jun Qin,et al.  A quantitative method for determining the robustness of complex networks , 2012, ArXiv.

[2]  Uwe Cantner,et al.  The Network of Innovators in Jena: An Application of Social Network Analysis , 2006 .

[3]  Jing Liu,et al.  An organizational coevolutionary algorithm for classification , 2006, IEEE Trans. Evol. Comput..

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

[5]  H. Stanley,et al.  Resilience of complex networks to random breakdown. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Jing Liu,et al.  Moving Block Sequence and Organizational Evolutionary Algorithm for General Floorplanning With Arbitrarily Shaped Rectilinear Blocks , 2008, IEEE Transactions on Evolutionary Computation.

[7]  M E J Newman Assortative mixing in networks. , 2002, Physical review letters.

[8]  M. Fiedler Algebraic connectivity of graphs , 1973 .

[9]  C. A. Coello Coello,et al.  Evolutionary multi-objective optimization: a historical view of the field , 2006, IEEE Computational Intelligence Magazine.

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

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

[12]  Albert-László Barabási,et al.  Evolution of Networks: From Biological Nets to the Internet and WWW , 2004 .

[13]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

[14]  J.W. Bialek,et al.  Approximate model of European interconnected system as a benchmark system to study effects of cross-border trades , 2005, IEEE Transactions on Power Systems.

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

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

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

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

[19]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[20]  R. Merris Laplacian matrices of graphs: a survey , 1994 .

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

[22]  Stephen P. Borgatti,et al.  Centrality and network flow , 2005, Soc. Networks.

[23]  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.

[24]  Jing Liu,et al.  A memetic algorithm for enhancing the robustness of scale-free networks against malicious attacks , 2014 .

[25]  Hongzhong Deng,et al.  Vulnerability of complex networks under intentional attack with incomplete information , 2007 .

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

[27]  Harry Eugene Stanley,et al.  Robustness of a Network of Networks , 2010, Physical review letters.

[28]  Kay Chen Tan,et al.  Adaptive Memetic Computing for Evolutionary Multiobjective Optimization , 2015, IEEE Transactions on Cybernetics.

[29]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[30]  Gary G. Yen,et al.  Cultural-Based Multiobjective Particle Swarm Optimization , 2011, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[31]  Qingfu Zhang,et al.  A Population Prediction Strategy for Evolutionary Dynamic Multiobjective Optimization , 2014, IEEE Transactions on Cybernetics.

[32]  Ernesto Estrada,et al.  Communicability betweenness in complex networks , 2009, 0905.4102.

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

[34]  Qingfu Zhang,et al.  MOEA/D-ACO: A Multiobjective Evolutionary Algorithm Using Decomposition and AntColony , 2013, IEEE Transactions on Cybernetics.

[35]  Li-Chen Fu,et al.  A two-stage hybrid memetic algorithm for multiobjective job shop scheduling , 2011, Expert Syst. Appl..

[36]  Qingfu Zhang,et al.  MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition , 2007, IEEE Transactions on Evolutionary Computation.

[37]  Jing Liu,et al.  A Multiobjective Evolutionary Algorithm Based on Similarity for Community Detection From Signed Social Networks , 2014, IEEE Transactions on Cybernetics.

[38]  Jing Liu,et al.  A Multiagent Evolutionary Algorithm for Combinatorial Optimization Problems , 2010, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

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

[40]  F. Harary,et al.  Eccentricity and centrality in networks , 1995 .

[41]  Ulrik Brandes,et al.  On variants of shortest-path betweenness centrality and their generic computation , 2008, Soc. Networks.

[42]  Fernando A. Tohmé,et al.  A memetic algorithm based on a NSGAII scheme for the flexible job-shop scheduling problem , 2010, Ann. Oper. Res..

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

[44]  I. Frisch,et al.  Analysis and Design of Survivable Networks , 1970 .

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

[46]  Chiuh-Cheng Chyu,et al.  A memetic algorithm for maximizing net present value in resource-constrained project scheduling problem , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[47]  S. Havlin,et al.  Optimization of robustness of complex networks , 2004, cond-mat/0404331.

[48]  Pramod K. Varshney,et al.  A Multiobjective Optimization Approach to Obtain Decision Thresholds for Distributed Detection in Wireless Sensor Networks , 2010, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[49]  Bin Li,et al.  Two-stage ensemble memetic algorithm: Function optimization and digital IIR filter design , 2013, Inf. Sci..

[50]  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.

[51]  Phillip Bonacich,et al.  Some unique properties of eigenvector centrality , 2007, Soc. Networks.

[52]  Lada A. Adamic,et al.  Power-Law Distribution of the World Wide Web , 2000, Science.

[53]  Jacques Teghem,et al.  Two-phase Pareto local search for the biobjective traveling salesman problem , 2010, J. Heuristics.

[54]  Frank Harary,et al.  Conditional connectivity , 1983, Networks.

[55]  Kay Chen Tan,et al.  An Investigation on Noisy Environments in Evolutionary Multiobjective Optimization , 2007, IEEE Transactions on Evolutionary Computation.

[56]  M. Newman,et al.  Mixing patterns in networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[57]  Jian Zhuang,et al.  Combining Crowding Estimation in Objective and Decision Space With Multiple Selection and Search Strategies for Multi-Objective Evolutionary Optimization , 2014, IEEE Transactions on Cybernetics.