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

Neumayer, Sebastian; Efrat, Alon; Modiano, Eytan

doi:10.1109/infcom.2012.6195690

Cited by 47 publications

(38 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finding the bottleneck regions can be accomplished by checking whether the disk failure disconnects the SD pair [24]. Since the number of dominating failure regions is polynomial in the number of links [2], [3], this task can be done in polynomial time.…”

Section: B Shielding Under the Geographical Failure Modelmentioning

confidence: 99%

Enhancing Network Robustness via Shielding

Zhang

Modiano

Hay

2017

IEEE/ACM Trans. Networking

Self Cite

View full text Add to dashboard Cite

Abstract-We consider shielding critical links to guarantee network connectivity under geographical and general failure models. We develop a mixed integer linear program (MILP) to obtain the minimum cost shielding to guarantee the connectivity of a single SD pair under a general failure model, and exploit geometric properties to decompose the shielding problem under a geographical failure model. We extend our MILP formulation to guarantee the connectivity of the entire network, and use Benders decomposition to significantly reduce the running time by exploiting its partial separable structure. We also apply simulated annealing to solve larger network problems to obtain near-optimal solutions in much shorter time. Finally, we extend the algorithms to guarantee partial network connectivity, and observe significant reduction in shielding cost, especially when the failure region is small. For example, when the failure region radius is 60 miles, we observe as much as 75% reduction in shielding cost by relaxing the connectivity requirement to 95% on a major US infrastructure network.

show abstract

Section: B Shielding Under the Geographical Failure Modelmentioning

confidence: 99%

Enhancing Network Robustness via Shielding

Zhang

Modiano

Hay

2017

IEEE/ACM Trans. Networking

Self Cite

View full text Add to dashboard Cite

show abstract

“…Much work on the robustness of a network against geographical failures has been done by Neumayer et al [9], [11], [12] for a different failure model than the one presented in this paper and only for circular and line failures. While most papers confine to the circular failure model, in this paper we consider ellipses and general polygons that allow to better capture reality.…”

Section: Related Workmentioning

confidence: 99%

“…on critical regions and region-disjoint max-flow problems [9], [12], often assumes that the failure of a region affects all nodes and links, even those links that are only traversing and have no terminating nodes in that region. While this may correspond to a realistic scenario in the case of an earthquake, it may be too restrictive for countries not on a fault line or for other scenarios, e.g.…”

Section: Related Workmentioning

confidence: 99%

Finding Critical Regions and Region-Disjoint Paths in a Network

Trajanovski

Kuipers

Ilić

et al. 2015

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-Due to their importance to society, communication networks should be built and operated to withstand failures. However, cost considerations make network providers less inclined to take robustness measures against failures that are unlikely to manifest, like several failures coinciding simultaneously in different geographic regions of their network.Considering networks embedded in a two-dimensional plane, we study the problem of finding a critical region -a part of the network that can be enclosed by a given elementary figure of predetermined size -whose destruction would lead to the highest network disruption. We determine that only a polynomial, in the input, number of non-trivial positions for such a figure need to be considered and propose a corresponding polynomialtime algorithm. In addition, we consider region-aware network augmentation to decrease the impact of a regional failure. We subsequently address the region-disjoint paths problem, which asks for two paths with minimum total weight between a source (s) and a destination (d) that cannot both be cut by a single regional failure of diameter D (unless that failure includes s or d). We prove that deciding whether region-disjoint paths exist is NP-hard and propose a heuristic region-disjoint paths algorithm.

show abstract

“…Work on multilink geographic failures has mostly focused on determining the geographic max-flow and min-cut values of a network under geographic failures of circular shape (e.g., Sen et al [145], Agarwal et al [146], and Neumayer et al [147]). Trajanovski et al [148] proved that, the problem of finding two region-disjoint paths is NP-hard, and they proposed a heuristic for it.…”

Section: Multiple Failuresmentioning

confidence: 99%

An Overview of Algorithms for Network Survivability

Kuipers

2012

ISRN Communications and Networking

View full text Add to dashboard Cite

Network survivability-the ability to maintain operation when one or a few network components fail-is indispensable for present-day networks. In this paper, we characterize three main components in establishing network survivability for an existing network, namely, (1) determining network connectivity, (2) augmenting the network, and (3) finding disjoint paths. We present a concise overview of network survivability algorithms, where we focus on presenting a few polynomial-time algorithms that could be implemented by practitioners and give references to more involved algorithms.

show abstract

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

Cited by 47 publications

References 13 publications

Enhancing Network Robustness via Shielding

Enhancing Network Robustness via Shielding

Finding Critical Regions and Region-Disjoint Paths in a Network

An Overview of Algorithms for Network Survivability

Contact Info

Product

Resources

About