Abstract
It appeared recently that some statistical properties of complex networks like the Internet, the World Wide Web or Peer-to-Peer systems have an important influence on their resilience to failures and attacks. In particular, scale-free networks (i.e. networks with power-law degree distribution) seem much more robust than random networks in case of failures, while they are more sensitive to attacks.
In this paper we deepen the study of the differences in the behavior of these two kinds of networks when facing failures or attacks. We moderate the general affirmation that scale-free networks are much more sensitive than random networks to attacks by showing that the number of links to remove in both cases is similar, and by showing that a slightly modified scenario for failures gives results similar to the ones for attacks. We also propose and analyze an efficient attack strategy against links.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bollobás, B.: Random Graphs. Academic Press, London (1985)
Erdös, P., Rényi, A.: On random graphs I. Publ. Math. Debrecen 6, 290–297 (1959)
Newman, M.E.J.: The structure and function of complex networks. SIAM Review 45(2), 167–256 (2003)
Barabási, A.-L., Deszo, Z., Ravasz, E., Yook, S.H., Oltvai, Z.: Scale-free and hierarchical structures in complex networks. In: Sitges Proceedings on Complex Networks (2004)
Dorogovtsev, S.N., Mendes, J.F.F.: Evolution of networks. Adv. Phys. 51, 1079–1187 (2002)
Dorogovtsev, S.N., Mendes, J.F.F.: Evolution of Networks: From Biological Nets tou the Internet and WWW. Oxford University Press, Oxford (2000)
Broder, A.Z., Kumar, S.R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J.L.: Graph structure in the web. WWW9 / Computer Networks 33(1-6), 309–320 (2000)
Broder, A.Z., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J.L.: Graph structure in the web. In: Proceedings of the 9th international World Wide Web conference on Computer networks: the international journal of computer and telecommunications netowrking, pp. 309–320. North-Holland Publishing Co., Amsterdam (2000)
Newman, M.E.J.: Random graphs as models of networks. In: Bornholdt, S., Schuster, H.G. (eds.) Hankbook of Graphs and Networks: From the Genome to the Internet. Wiley-vch, Chichester (2003)
Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the internet topology. In: SIGCOMM, pp. 251–262 (1999)
Adamic, L., Huberman, B.: Power-law distribution of the world wide web. Science 287 (2000)
Ripeanu, M., Foster, I., Iamnitchi, A.: Mapping the gnutella network: Properties of large-scale peer-to-peer systems and implications for system design. IEEE Internet Computing Journal special issue on peer-to-peer networking 6(1) (2002)
Albert, R., Jeong, H., Barabási., A.-L.: Error and attack tolerance in complex networks. Nature 406, 378–382 (2000)
Callaway, D.S., Newman, M.E.J., Strogatz, S.H., Watts, D.J.: Network robustness and fragility: Percolation on random graphs. Phys. Rev. Lett. 85, 5468–5471 (2000)
Cohen, R., Erez, K., ben-Avraham, D., Havlin, S.: Breakdown of the internet under intentional attack. Phys. Rev. Lett. 86, 3682–3685 (2001)
Park, S.-T., Khrabrov, A., Pennock, D.M., Lawrence, S., Giles, C.L., Ungar, L.H.: Static and dynamic analysis of the internet’s susceptibility to faults and attacks. In: IEEE Infocom 2003, San Francisco, CA, April 1-3 (2003)
Broido, A., Claffy, K.: Topological resilience in ip and as graphs (2002), http://www.caida.org/analysis/topology/resilience/
Latora, V., Marchiori, M.: Efficient behavior of small-world networks. Phys. Rev. Lett. 87 (2001)
Crucitti, P., Latora, V., Marchiori, M., Rapisarda, A.: Efficiency or scale-free networks: error and attack tolerance. Physica A 320, 622–642 (2003)
Pastor-Satorras, R., Vespignani, A.: Evolution and Structure of the Internet: A Statistical Physics Approach. Cambridge University Press, Cambridge (2003) (to appear)
Molloy, M., Reed, B.: A critical point for random graphs with a given degree sequence. Random Structures and Algorithms 6, 161 (1995)
Cohen, R., Erez, K., ben-Avraham, D., Havlin, S.: Resilience of the internet to random breakdown. Phys. Rev. Lett. 85, 4626 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guillaume, JL., Latapy, M., Magnien, C. (2005). Comparison of Failures and Attacks on Random and Scale-Free Networks. In: Higashino, T. (eds) Principles of Distributed Systems. OPODIS 2004. Lecture Notes in Computer Science, vol 3544. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11516798_14
Download citation
DOI: https://doi.org/10.1007/11516798_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27324-0
Online ISBN: 978-3-540-31584-1
eBook Packages: Computer ScienceComputer Science (R0)