A New Framework for Network Disruption
Social and Information Networks
2011-09-15 v1 Combinatorics
Optimization and Control
Physics and Society
Abstract
Traditional network disruption approaches focus on disconnecting or lengthening paths in the network. We present a new framework for network disruption that attempts to reroute flow through critical vertices via vertex deletion, under the assumption that this will render those vertices vulnerable to future attacks. We define the load on a critical vertex to be the number of paths in the network that must flow through the vertex. We present graph-theoretic and computational techniques to maximize this load, firstly by removing either a single vertex from the network, secondly by removing a subset of vertices.
Cite
@article{arxiv.1109.2954,
title = {A New Framework for Network Disruption},
author = {Susan E. Martonosi and Doug Altner and Michael Ernst and Elizabeth Ferme and Kira Langsjoen and Danika Lindsay and Sean Plott and Andrew S. Ronan},
journal= {arXiv preprint arXiv:1109.2954},
year = {2011}
}
Comments
Submitted for peer review on September 13, 2011