Abstract
K-core (k-shell) index is an interesting measure that describes the core and fringe nodes in a complex network. Recent studies have revealed that some high k-core value nodes may play a vital role in information diffusion. As a result, one may expect that attacking high k-core nodes preferentially can collapse the Internet easily. To our surprise, however, the experiments on two Internet AS-level topologies show that: Although a k-core-preferred attack is feasible in reality, it turns out to be less effective than a classic degree-preferred attack. Indeed, as indicated by the measure: normalized susceptibility, we need to remove 2% to 3% more nodes in a k-core-preferred attack to make the network collapsed. Further investigation on the nodes in a same shell discloses that these nodes often have degrees varied drastically, among which there are nodes with high k-core values but low degrees. These nodes cannot contribute many link deletions in an early stage of a k-core-preferred attack, and therefore make it less malicious than a degree-preferred attack.
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
Albert, R., Jeong, H., Barabási, A.L.: Error and attack tolerance of complex networks. Nature 406(6794), 378–382 (2000)
Boguñá, M., Papadopoulos, F., Krioukov, D.: Sustaining the internet with hyperbolic mapping. Nature Communications 1(62) (2010)
Brandes, U.: A faster algorithm for betweenness centrality. Journal of Mathematical Sociology 25, 163–177 (2001)
Butler, K., Farley, T., McDaniel, P., Rexford, J.: A survey of bgp security issues and solutions. Proceedings of the IEEE 98, 100–122 (2010)
Carmi, S., Havlin, S., Kirkpatrick, S., Shavitt, Y., Shir, E.: A model of internet topology using k-shell decomposition. PNAS 104(27), 11150–11154 (2007)
Cohen, R., Erez, K., Ben-Avraham, D., Havlin, S.: Resilience of the internet to random breakdowns. Phys. Rev. Lett. 85(21), 4626–4628 (2000)
Cohen, R., Erez, K., Ben-Avraham, D., Havlin, S.: Breakdown of the internet under intentional attack. Phys. Rev. Lett. 86(16), 3682–3685 (2001)
Cowie, J., Ogielski, A.T., Premore, B.J., Yuan, Y.: Internet worms and global routing instabilities. In: Proc. SPIE, vol. 4868 (2002)
Donnet, B., Friedman, T.: Internet topology discovery: a survey. IEEE Communications Surveys and Tutorials 9(4), 2–15 (2007)
Dorogovtsev, S.N., Goltsev, A.V., Mendes, J.F.F.: k-core organization of complex networks. Phys. Rev. Lett. 96, 040601 (2006)
Guillaume, J.L., Latapy, M., Magoni, D.: Relevance of massively distributed explorations of the internet topology: Qualitative results. Computer Networks 50, 3197–3224 (2006)
Holme, P., Kim, B.J., Yoon, C.N., Han, S.K.: Attack vulnerability of complex networks. Phys. Rev. EÂ 65(5), 056109 (2002)
Huffaker, B., Plummer, D., Moore, D., Claffy, K.C.: Topology discovery by active probing. In: SAINT-W 2002, pp. 90–96 (2002)
Kitsak, M., Gallos, L.K., Havlin, S., Liljeros, F., Muchnik, L., Stanley, H.E., Makse, H.A.: Identification of influential spreaders in complex networks. Nature Physics 6, 888–893 (2010)
Kumpula, J.M., Onnela, J.P., Saramäki, J., Kaski, K., Kertész, J.: Emergence of communities in weighted networks. Phys. Rev. Lett. 99(22), 228701 (2007)
Latora, V., Marchiori, M.: Efficient behavior of small-world networks. Phys. Rev. Lett. 87(19), 198701 (2001)
Liljenstam, M., Yuan, Y., Premore, B.J., Nicol, D.M.: A mixed abstraction level simulation model of large-scale internet worm infestations. In: MASCOTS 2002, pp. 109–116 (2002)
Schneider, C.M., Moreira, A.A., Andrade Jr., J.S., Havlin, S., Herrmann, H.J.: Mitigation of malicious attacks on networks. PNAS 108(10), 3838–3841 (2011)
Seidman, S.B.: Network structure and minum degree. Social Networks 5, 269–287 (1983)
Shakkottai, S., Fomenkov, M., Koga, R., Krioukov, D., Claffy, K.: Evolution of the internet as-level ecosystem. European Physical Journal B 74, 271–278 (2006)
Zhang, G.Q., Zhang, G.Q., Yang, Q.F., Cheng, S.Q., Zhou, T.: Evolution of the internet and its cores. New J. Phys. 10(12), 123027 (2008)
Zhang, J., Zhao, H., Xu, J., Liu, Z.: Characterizing and modeling the internet router-level topology - the hierarchical features and hir model. Comput. Commun. 33, 2001–2011 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhao, J., Wu, J., Chen, M., Fang, Z., Xu, K. (2013). K-core-preferred Attack to the Internet: Is It More Malicious Than Degree Attack?. In: Wang, J., Xiong, H., Ishikawa, Y., Xu, J., Zhou, J. (eds) Web-Age Information Management. WAIM 2013. Lecture Notes in Computer Science, vol 7923. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38562-9_73
Download citation
DOI: https://doi.org/10.1007/978-3-642-38562-9_73
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38561-2
Online ISBN: 978-3-642-38562-9
eBook Packages: Computer ScienceComputer Science (R0)