Partitioning the Internet

Wachs, Matthias; Grothoff, Christian; Thurimella, Ramakrishna

doi:10.1109/crisis.2012.6378944

Cited by 4 publications

(2 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…While not their primary focus, the work of [32] finds that the highly skewed degree distribution for individual nodes within ASs can result in the loss of a large number of links for removal of a single node. This supports the findings of [33] where they investigate the ability to maliciously partition the Internet through causing intentional AS failures. This work is most similar to ours, but focuses on the intentional failure of sets of ASs irrespective of their physical location or relationship to nation states.…”

Section: Related Worksupporting

confidence: 82%

The Resilience of the Internet to Colluding Country Induced Connectivity Disruptions

Mell

Harang

Gueye

2015

Proceedings 2015 Workshop on Security of Emerging Networking Technologies

View full text Add to dashboard Cite

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.

show abstract

Section: Related Worksupporting

confidence: 82%

The Resilience of the Internet to Colluding Country Induced Connectivity Disruptions

Mell

Harang

Gueye

2015

Proceedings 2015 Workshop on Security of Emerging Networking Technologies

View full text Add to dashboard Cite

show abstract

“…Nevertheless, these algorithms need to have a priori knowledge about the network topology, which is not usual in real-life problems. A different approach is described in Wachs, Grothoff, and Thurimella (2012), where the authors present a heuristic algorithm to study the separators in Autonomous Systems 1 of Internet.…”

mentioning

confidence: 99%

Finding weaknesses in networks using Greedy Randomized Adaptive Search Procedure and Path Relinking

2020

View full text Add to dashboard Cite

In recent years, the relevance of cybersecurity has been increasingly evident to companies and institutions, as well as to final users. Because of that, it is important to ensure the robustness of a network. With the aim of improving the security of the network, it is desirable to find out which are the most critical nodes in order to protect them from external attackers. This work tackles this problem, named the α-separator problem, from a heuristic perspective, proposing an algorithm based on the Greedy Randomized Adaptive Search Procedure (GRASP). In particular, a novel approach for the constructive procedure is proposed, where centrality metrics derived from social network analysis are used as a greedy criterion. Furthermore, the quality of the provided solutions is improved by means of a combination method based on Path Relinking (PR). This work explores different variants of PR, also adapting the most recent one, Exterior PR, for the problem under consideration. The combination of GRASP + PR allows the algorithm to obtain high-quality solutions within a reasonable computing time. The proposal is supported by a set of intensive computational experiments that show the quality of the proposal, comparing it with the most competitive algorithm found in the state of art.

show abstract