Geographic max-flow and min-cut under a circular disk failure model
Name
Modiano_Geographic max-flow.pdf
Size
335.45 KB
Format
Adobe PDF
Checksum (MD5)
d5e5b6c197035b8930ab1b3ff2cc7261
Author(s)
Efrat, Alon
Neumayer, Sebastian James
Modiano, Eytan H.
Date Issued
March 2012
Journal
Proceedings of the 2012 IEEE INFOCOM
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Neumayer, Sebastian, Alon Efrat, and Eytan Modiano. “Geographic max-flow and min-cut under a circular disk failure model.” In 2012 Proceedings IEEE INFOCOM, 2736-2740. Institute of Electrical and Electronics Engineers, 2012.
Version
Author's final manuscript
Abstract
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.
MIT Department
Lincoln Laboratory
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/INFCOM.2012.6195690
