Partitioning the Internet

This paper presents experimental results for calculating both node- and edge separators on Autonomous System graphs generated from BGP routing information. The separator of a network graph describes a range of interesting properties as it captures components that are critical to overall connectivity. These components play special roles in terms of routing and deserve special attention from those in-charge of network security and resilience. We present empirical evidence showing that the Autonomous System Graph (AS Graph) is hard to separate and large portions always remain connected even in the case of a significant number of concurrent Byzantine failures of Autonomous Systems or connections between Autonomous Systems.

[1]  Brice Augustin,et al.  Detection, understanding, and prevention of traceroute measurement artifacts , 2008, Comput. Networks.

[2]  Brice Augustin,et al.  IXPs: mapped? , 2009, IMC '09.

[3]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[4]  Olaf Maennel,et al.  Bigfoot, sasquatch, the yeti and other missing links: what we don't know about the as graph , 2008, IMC '08.

[5]  S.,et al.  An Efficient Heuristic Procedure for Partitioning Graphs , 2022 .

[6]  Aleksandrs Slivkins,et al.  Network failure detection and graph connectivity , 2004, SODA '04.

[7]  Walter Willinger,et al.  Eyeball ASes: from geography to connectivity , 2010, IMC '10.

[8]  Bruce Hendrickson,et al.  A Multi-Level Algorithm For Partitioning Graphs , 1995, Proceedings of the IEEE/ACM SC95 Conference.

[9]  Walter Willinger,et al.  The origin of power laws in Internet topologies revisited , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[10]  Curt Jones,et al.  A Heuristic for Reducing Fill-In in Sparse Matrix Factorization , 1993, PPSC.

[11]  Rami Cohen,et al.  The Internet Dark Matter - on the Missing Links in the AS Connectivity Map , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[12]  Ramesh K. Sitaraman,et al.  Assessing the vulnerability of replicated network services , 2010, CoNEXT.

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

[14]  Paul S. Bonsma,et al.  Most balanced minimum cuts , 2010, Discret. Appl. Math..

[15]  Uriel Feige,et al.  Finding small balanced separators , 2006, STOC '06.