K-core-preferred Attack to the Internet: Is It More Malicious Than Degree Attack?

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.

[1]  Stephen B. Seidman,et al.  Network structure and minimum degree , 1983 .

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

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

[4]  Benoit Donnet,et al.  Internet topology discovery: a survey , 2007, IEEE Communications Surveys & Tutorials.

[5]  Jean-Loup Guillaume,et al.  Relevance of massively distributed explorations of the Internet topology: Qualitative results , 2006, Comput. Networks.

[6]  Dmitri V. Krioukov,et al.  Evolution of the Internet AS-level ecosystem , 2006, Complex.

[7]  Yuval Shavitt,et al.  A model of Internet topology using k-shell decomposition , 2007, Proceedings of the National Academy of Sciences.

[8]  Dana Porrat,et al.  INFORMATION THEORY OF WIDEBAND COMMUNICATIONS , 2007, IEEE Communications Surveys & Tutorials.

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

[10]  Marián Boguñá,et al.  Sustaining the Internet with Hyperbolic Mapping , 2010, Nature communications.

[11]  Yougu Yuan,et al.  Internet worms and global routing instabilities , 2002, SPIE ITCom.

[12]  U. Brandes A faster algorithm for betweenness centrality , 2001 .

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

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

[15]  Hai Zhao,et al.  Characterizing and modeling the Internet Router-level topology - The hierarchical features and HIR model , 2010, Comput. Commun..

[16]  Lev Muchnik,et al.  Identifying influential spreaders in complex networks , 2010, 1001.5285.

[17]  Patrick D. McDaniel,et al.  A Survey of BGP Security Issues and Solutions , 2010, Proceedings of the IEEE.

[18]  David M. Nicol,et al.  A mixed abstraction level simulation model of large-scale Internet worm infestations , 2002, Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems.

[19]  Jari Saramäki,et al.  Emergence of communities in weighted networks. , 2007, Physical review letters.

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

[21]  Sergey N. Dorogovtsev,et al.  K-core Organization of Complex Networks , 2005, Physical review letters.

[22]  Tao Zhou,et al.  Evolution of the Internet and its cores , 2008 .

[23]  K. Claffy,et al.  Topology discovery by active probing , 2002, Proceedings 2002 Symposium on Applications and the Internet (SAINT) Workshops.