Bounding Damage From Link Destruction, with Application to the Internet

Publication Date

2007

Journal or Book Title

SIGMETRICS'07: PROCEEDINGS OF THE 2007 INTERNATIONAL CONFERENCE ON MEASUREMENT & MODELING OF COMPUTER SYSTEMS

Abstract

in terms of the number of pairs of communicating nodes? The answer to this question is a critical component of quantifying the damage to networks that results from attacks on inter-domain routing, intra-domain routing, mobile network routing, and sensor networks. In this short paper, we introduce a technique that provides a lower bound on a graph’s connectivity after link removal. Our experimental results show that tight bounds can be expected for attacks involving the removal of a small fraction of the network links. While this is a limitation, we expect that, in general, the resources required to carry out an attack scale proportionally with the number of links removed. Consequently, our results are tight for cases that we expect to be more common since weaker attackers are more numerous.

DOI

http://dx.doi.org/10.1145/1269899.1254933

Pages

367-368

Volume

35

Issue

1

Book Series Title

ACM SIGMETRICS PERFORMANCE EVALUATION REVIEW, SPECIAL ISSUE

This document is currently not available here.

Share

COinS