The Resilience of the Internet to Colluding Country Induced Connectivity Disruptions

We show that the strength of Internet-based network interconnectivity of countries is increasing over time. We then evaluate bounds on the extent to which a group of colluding countries can disrupt this connectivity. We evaluate the degree to which a group of countries can disconnect two other countries, isolate a set of countries from the Internet, or even break the Internet up into non-communicative clusters. To do this, we create an interconnectivity map of the worldwide Internet routing infrastructure at a country level of abstraction. We then examine how groups of countries may use their pieces of routing infrastructure to filter out the traffic of other countries (or to block entire routes). Overall, bounds analysis indicates that the ability of countries to perform such disruptions to connectivity has diminished significantly from 2008 to 2013. However, we show that the majority of the gains in robustness go to countries that had already displayed significant robustness to the types of attacks that we consider. The countries that displayed higher initial vulnerability to such attacks did not become significantly more robust over the time period of analysis. Keywords— Internet, resilience, connectivity, autonomous systems, security, countries

[1]  Christian Grothoff,et al.  Partitioning the Internet , 2012, 2012 7th International Conference on Risks and Security of Internet and Systems (CRiSIS).

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

[3]  Junichiro Fukuyama,et al.  NP-completeness of the Planar Separator Problems , 2006, J. Graph Algorithms Appl..

[4]  Peter Sanders,et al.  Recent Advances in Graph Partitioning , 2013, Algorithm Engineering.

[5]  Jin-Kao Hao,et al.  Breakout Local Search for the Vertex Separator Problem , 2013, IJCAI.

[6]  Randy H. Katz,et al.  Geographic Properties of Internet Routing , 2002, USENIX Annual Technical Conference, General Track.

[7]  Kang G. Shin,et al.  Internet routing resilience to failures: analysis and implications , 2007, CoNEXT '07.

[8]  Tony Bates,et al.  Guidelines for creation, selection, and registration of an Autonomous System (AS) , 1996, RFC.

[9]  Chi Guo,et al.  Analysis on the “Robust Yet Fragile” Nature of Internet: Load, Capacity and the Cascading Failure Avalanche Effect , 2008, 2008 The 9th International Conference for Young Computer Scientists.

[10]  Bin Liu,et al.  Evaluating Potential Routing Diversity for Internet Failure Recovery , 2010, 2010 Proceedings IEEE INFOCOM.

[11]  Marco Chiesa,et al.  Analysis of country-wide internet outages caused by censorship , 2011, IMC '11.

[12]  L LisaDeKeukelaere,et al.  Good for Business , 2006 .

[13]  Lixin Gao,et al.  On inferring autonomous system relationships in the Internet , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[14]  Curt Jones,et al.  Finding Good Approximate Vertex and Edge Partitions is NP-Hard , 1992, Inf. Process. Lett..

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

[16]  Dániel Marx,et al.  Parameterized graph separation problems , 2004, Theor. Comput. Sci..

[17]  Walter Willinger,et al.  Robustness and the Internet: Design and evolution , 2002 .

[18]  Dieter Kratsch,et al.  Listing All Minimal Separators of a Graph , 1998, SIAM J. Comput..

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

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

[21]  Danny Dolev,et al.  Internet resiliency to attacks and failures under BGP policy routing , 2006, Comput. Networks.