Design of Network Topology in an Adversarial Environment

We study the strategic interaction between a network manager whose goal is to choose (as communication infrastructure) a spanning tree of a network given as an undirected graph, and an attacker who is capable of attacking a link in the network. We model their interaction as a zero-sum game and discuss a particular set of Nash equilibria. More specifically, we show that there always exists a Nash equilibrium under which the attacker targets a critical set of links. A set of links is called critical if it has maximum vulnerability, and the vulnerability of a set of links is defined as the minimum fraction of links the set has in common with a spanning tree. Using simple examples, we discuss the importance of critical subsets in the design of networks that are aimed to be robust against attackers. Finally, an algorithm is provided, to compute a critical subset of a given graph.

[1]  J. Neumann.  Zur Theorie der Gesellschaftsspiele , 1928 .

[2]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[3]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[4]  C. Nash-Williams.  Edge-disjoint spanning trees of finite graphs , 1961 .

[5]  W. T. Tutte.  On the Problem of Decomposing a Graph into n Connected Factors , 1961 .

[6]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[7]  D. R. Fulkerson,et al.  Blocking and anti-blocking pairs of polyhedra , 1971, Math. Program..

[8]  Dan Gusfield,et al.  Connectivity and Edge-Disjoint Spanning Trees , 1983, Information Processing Letters.

[9]  William H. Cunningham,et al.  Optimal attack and reinforcement of a network , 1985, JACM.

[10]  S. Chopra.  On the spanning tree polyhedron , 1989 .

[11]  Raul Cordovil,et al.  Clutters and matroids , 1991, Discret. Math..

[12]  David R. Karger,et al.  An Õ(n2) algorithm for minimum cuts , 1993, STOC.

[13]  Mechthild Stoer,et al.  A simple min-cut algorithm , 1997, JACM.

[14]  Robert J. Vanderbei,et al.  Linear Programming: Foundations and Extensions , 1998, Kluwer international series in operations research and management service.

[15]  G. Cornuéjols,et al.  Combinatorial optimization : packing and covering , 2001 .

[16]  A. Matveev.  ON BLOCKERS IN BOUNDED POSETS , 2000, math/0010092.

[17]  M. Birkner,et al.  Blow-up of semilinear PDE's at the critical dimension. A probabilistic approach , 2002 .

[18]  Tim Roughgarden,et al.  Approximation via cost-sharing: a simple approximation algorithm for the multicommodity rent-or-buy problem , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[19]  A. Matveev.  Maps on posets, and blockers , 2004, math/0411025.

[20]  D. Younger.  Dedication: W. T. Tutte , 2004 .

[21]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[22]  Panos M. Pardalos,et al.  The wireless network jamming problem , 2007, J. Comb. Optim..

[23]  Tim Roughgarden,et al.  Approximation via cost sharing , 2007, J. ACM.

[24]  Christian Scheideler,et al.  A jamming-resistant MAC protocol for single-hop wireless networks , 2008, PODC '08.

[25]  Hong-Jian Lai,et al.  Edge-connectivity and edge-disjoint spanning trees , 2009, Discret. Math..

[26]  Eric V. Denardo,et al.  Flows in Networks , 2011 .