Max-flow min-cut theorem and faster algorithms in a circular disk failure model

Fault-tolerance is one of the most important factors in designing networks. Failures in networks are sometimes caused by an event occurring in specific geographical regions such as hurricanes, earthquakes, bomb attacks, and Electromagnetic Pulse (EMP) attacks. In INFOCOM 2012, Neumayer et al. introduced geographical variants of max-flow min-cut problems in a circular disk failure model, in which each failure is represented by a disk with a predetermined size. In this paper, we solve two open problems in this model: we give a first polynomial-time algorithm for the geographic max-flow problem, and prove a conjecture of Neumayer et al. on a relationship between the geographic max-flow and the geographic min-cut.

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

[2]  Piyush Gupta,et al.  Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .

[3]  Piet Van Mieghem,et al.  Finding critical regions in a network , 2013, 2013 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[4]  Thomas G. Robertazzi,et al.  Critical connectivity phenomena in multihop radio models , 1989, IEEE Trans. Commun..

[5]  Christian Bettstetter,et al.  Connectivity of Wireless Multihop Networks in a Shadow Fading Environment , 2003, MSWIM '03.

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

[7]  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.

[8]  Ling Zhou,et al.  Fault-Tolerance in Sensor Networks: A New Evaluation Metric , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[9]  Biswanath Mukherjee,et al.  Disaster survivability in optical communication networks , 2013, Comput. Commun..

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

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

[12]  Alexander Schrijver,et al.  Non-interfering dipaths in planar digraphs , 1991 .

[13]  Adrian Vetta,et al.  Galaxy cutsets in graphs , 2010, J. Comb. Optim..

[14]  Bruce A. Reed,et al.  Induced Circuits in Planar Graphs , 1994, J. Comb. Theory, Ser. B.

[15]  Bruce A. Reed,et al.  Non-Interfering Network Flows , 1992, SWAT.