TY - JOUR
T1 - Geographic max-flow and min-cut under a circular disk failure model
AU - Neumayer, Sebastian
AU - Efrat, Alon
AU - Modiano, Eytan
N1 - Funding Information:
This work was supported by National Science Foundation – United States Grants CNS-0830961 , CNS-1017714 , CNS-1017800 , NSF CAREER Grant 0348000 , and by DTRA Grants HDTRA1-07-1-0004 and HDTRA-09-1-005 . Preliminary and partial versions of this paper appeared in Proc. IEEE INFOCOM’12, March 2012 [12] .
PY - 2015/2/11
Y1 - 2015/2/11
N2 - 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.
AB - 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.
KW - Electromagnetic Pulse (EMP)
KW - Fiber-optic
KW - Geographically correlated failures
KW - Min-cut max-flow
KW - Network survivability
UR - http://www.scopus.com/inward/record.url?scp=84920716239&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84920716239&partnerID=8YFLogxK
U2 - 10.1016/j.comnet.2014.10.026
DO - 10.1016/j.comnet.2014.10.026
M3 - Article
AN - SCOPUS:84920716239
VL - 77
SP - 117
EP - 127
JO - Computer Networks
JF - Computer Networks
SN - 1389-1286
ER -