Optimizing Scale-Free Network Robustness with the Great Deluge Algorithm

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10868)

Abstract

This paper examines the robustness of scale-free networks against degree-based attacks on their nodes. Having a robust network means the network is less likely to suffer catastrophic failure if some parts of its structure are destroyed. Many critical real world systems such as the Internet and power grids can be modeled as networks, so finding a way to reduce the chance of failure in these systems is very important.

The robustness of these networks is increased using an optimization procedure based on edge swaps. In previous work, the optimization has been done with a simple hill climbing algorithm. The hill climber is prone to getting stuck in local optima, so Buesser et al. proposed using simulated annealing as a metaheuristic to get better solutions, getting good results.

This paper introduces a great deluge metaheuristic approach for this problem. To the author’s knowledge, this algorithm has never been used for network robustness optimization before, and shows promising results. Testing indicates that the great deluge-based optimization results in larger improvements to network robustness than the simulated annealing optimization, and is considerably faster for small networks.

Notes

Acknowledgements

The support provided by the Natural Sciences and Engineering Research Council (NSERC) of Canada is gratefully acknowledged.

References

  1. 1.
    Herrmann, H.J., Schneider, C.M., Moreira, A.A., Andrade Jr., J.S., Havlin, S.: Onion-like network topology enhances robustness against malicious attacks. J. Stat. Mech. Theor. Exp. 2011(01), P01027 (2011)CrossRefGoogle Scholar
  2. 2.
    Cohen, R., Erez, K., Ben-Avraham, D., Havlin, S.: Breakdown of the internet under intentional attack. Phys. Rev. Lett. 86(16), 3682 (2001)CrossRefGoogle Scholar
  3. 3.
    Albert, R., Barabási, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74(1), 47 (2002)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Buesser, P., Daolio, F., Tomassini, M.: Optimizing the robustness of scale-free networks with simulated annealing. In: Dobnikar, A., Lotrič, U., Šter, B. (eds.) ICANNGA 2011. LNCS, vol. 6594, pp. 167–176. Springer, Heidelberg (2011).  https://doi.org/10.1007/978-3-642-20267-4_18CrossRefGoogle Scholar
  5. 5.
    Louzada, V.H., Daolio, F., Herrmann, H.J., Tomassini, M.: Generating robust and efficient networks under targeted attacks. In: Król, D., Fay, D., Gabryś, B. (eds.) Propagation Phenomena in Real World Networks, pp. 215–224. Springer, Cham (2015).  https://doi.org/10.1007/978-3-319-15916-4CrossRefGoogle Scholar
  6. 6.
    Zhou, M., Liu, J.: A memetic algorithm for enhancing the robustness of scale-free networks against malicious attacks. Phys. A Stat. Mech. Appl. 410, 131–143 (2014)CrossRefGoogle Scholar
  7. 7.
    Dueck, G.: New optimization heuristics: the great deluge algorithm and the record-to-record travel. J. Comput. Phys. 104(1), 86–92 (1993)CrossRefGoogle Scholar
  8. 8.
    Lü, J., Chen, G., Ogorzalek, M.J., Trajković, L.: Theory and applications of complex networks: advances and challenges. In: 2013 IEEE International Symposium on Circuits and Systems (ISCAS), pp. 2291–2294. IEEE (2013)Google Scholar
  9. 9.
    Schneider, C.M., Moreira, A.A., Andrade, J.S., Havlin, S., Herrmann, H.J.: Mitigation of malicious attacks on networks. Proc. Natl. Acad. Sci. 108(10), 3838–3841 (2011)CrossRefGoogle Scholar
  10. 10.
    Csárdi, G., Nepusz, T. http://igraph.org/python/

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Computer ScienceBrock UniversitySt. CatharinesCanada

Personalised recommendations