Geographic max-flow and min-cut under a circular disk failure model

Failures in fiber-optic networks may be caused by natural disasters, such as floods or earthquakes, as well as other events, such as an Electromagnetic Pulse (EMP) attack. These events occur in specific geographical locations, therefore the geography of the network determines the effect of failure events on the network's connectivity and capacity. In this paper we consider a generalization of the min-cut and max-flow problems under a geographic failure model. Specifically, we consider the problem of finding the minimum number of failures, modeled as circular disks, to disconnect a pair of nodes and the maximum number of failure disjoint paths between pairs of nodes. This model applies to the scenario where an adversary is attacking the network multiple times with intention to reduce its connectivity. We present a polynomial time algorithm to solve the geographic min-cut problem and develop an ILP formulation, an exact algorithm, and a heuristic algorithm for the geographic max-flow problem.

[1]  John H. Reif,et al.  Minimum S-T Cut of a Planar Undirected Network in O(n log²(n)) Time , 1981, ICALP.

[2]  Eytan Modiano,et al.  Network Reliability under Random Circular Cuts , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[3]  Arunabha Sen,et al.  Region-based connectivity - a new paradigm for design of fault-tolerant networks , 2009, 2009 International Conference on High Performance Switching and Routing.

[4]  Eytan Modiano,et al.  Network Reliability With Geographically Correlated Failures , 2010, 2010 Proceedings IEEE INFOCOM.

[5]  John H. Reif,et al.  Minimum s-t Cut of a Planar Undirected Network in O(n log2(n)) Time , 1983, SIAM J. Comput..

[6]  Micha Sharir,et al.  A near-linear algorithm for the planar segment-center problem , 1994, SODA '94.

[7]  Philip N. Klein,et al.  An O (n log n) algorithm for maximum st-flow in a directed planar graph , 2006, SODA '06.

[8]  Dan Bienstock,et al.  Some Generalized Max-Flow Min-Cut Problems in the Plane , 1991, Math. Oper. Res..

[9]  Joseph S. B. Mitchell,et al.  Thick non-crossing paths and minimum-cost flows in polygonal domains , 2007, SCG '07.

[10]  Eytan Modiano,et al.  Assessing the Vulnerability of the Fiber Infrastructure to Disasters , 2009, IEEE INFOCOM 2009.

[11]  Moshe Zukerman,et al.  Topology Design of Undersea Cables Considering Survivability Under Major Disasters , 2009, 2009 International Conference on Advanced Information Networking and Applications Workshops.

[12]  Eytan Modiano,et al.  Geographic max-flow and min-cut under a circular disk failure model , 2012, INFOCOM.

[13]  Robert J Hermann,et al.  Report of the Commission to Assess the Threat to the United States from Electromagnetic Pulse (EMP) Attack: Critical National Infrastructures , 2008 .

[14]  Gil Zussman,et al.  The resilience of WDM networks to probabilistic geographical failures , 2011, INFOCOM 2011.

[15]  J. A. Bondy,et al.  Graph Theory , 2008, Graduate Texts in Mathematics.