2012 7th International Conference on Risks and Security of Internet and Systems (CRiSIS) (2012)
Cork, Ireland Ireland
Oct. 10, 2012 to Oct. 12, 2012
Ramakrishna Thurimella , University of Denver
Matthias Wachs , TU München
Christian Grothoff , TU München
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.
Particle separators, Internet, Peer to peer computing, Heating, Routing, Approximation methods, Partitioning algorithms
R. Thurimella, M. Wachs and C. Grothoff, "Partitioning the Internet," 2012 7th International Conference on Risks and Security of Internet and Systems (CRiSIS)(CRISIS), Cork, Ireland Ireland, 2012, pp. 1-8.