Network vulnerability to single, multiple, and probabilistic physical attacks

Agarwal, Pankaj K.; Efrat, Alon; Ganjugunte, Shashidhara K.; Hay, David; Sankararaman, Swaminathan; Zussman, Gil

doi:10.1109/milcom.2010.5679556

Cited by 60 publications

(44 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In each case, we also discuss possible directions of future research. A large group of research papers present results for a model of isolated random failures [1]. In this model, failures of network elements have no mutual correlation.…”

Section: Reliability Of Wireless Communicationsmentioning

confidence: 99%

“…Results of modeling the simultaneous failures occurring in multiple regions can be found e.g., in [1,121].…”

Section: Reliability Of Wireless Communicationsmentioning

confidence: 99%

“…However, as shown in Fig. 11c, the removal of links (1,6) and (3,4) in the lowest level partitions the graph and necessitates their removal in the above levels as well. Thus we can model the impact of challenges to the physical infrastructure on higher-level services by understanding the resilience properties induced on the higher level graph that delivers these services.…”

Section: Multilevel Network Structurementioning

confidence: 99%

“…Also, apart from failures that are random by nature, there is a large group of accidents being result of malicious human activities, referred to as attacks. The respective proposals of resistantto-attack routing approaches can be found e.g., in [1,117].…”

mentioning

confidence: 99%

See 3 more Smart Citations

Future research directions in design of reliable communication systems

et al. 2015

View full text Add to dashboard Cite

In this position paper on reliable networks, we discuss new trends in the design of reliable communication systems. We focus on a wide range of research directions including protection against software failures as well as failures of communication systems equipment. In particular, we outline future research trends in software failure mitigation, reliability of wireless communications, robust optimization and network design, multilevel and multirealm network resilience, multiple criteria routing approaches in multilayer networks, resilience options of the fixed IP backbone network in the interplay with the optical layer survivability, reliability of cloud computing networks, and

show abstract

Section: Reliability Of Wireless Communicationsmentioning

confidence: 99%

“…Results of modeling the simultaneous failures occurring in multiple regions can be found e.g., in [1,121].…”

Section: Reliability Of Wireless Communicationsmentioning

confidence: 99%

Section: Multilevel Network Structurementioning

confidence: 99%

mentioning

confidence: 99%

See 2 more Smart Citations

Future research directions in design of reliable communication systems

et al. 2015

View full text Add to dashboard Cite

show abstract

“…This emerging field of geographically correlated failures has started gaining attention only recently [2], [17], [24]- [26], [31], [32], [37]. However, unlike most of the recent work in this field, we focus on probabilistic attacks and on a number of simultaneous attacks.…”

Section: Introductionmentioning

confidence: 99%

The resilience of WDM networks to probabilistic geographical failures

Agarwal

Efrat

Ganjugunte

et al. 2011

2011 Proceedings IEEE INFOCOM

Self Cite

126

View full text Add to dashboard Cite

Abstract-Telecommunications networks, and in particular optical WDM networks, are vulnerable to large-scale failures of their physical infrastructure, resulting from physical attacks (such as an Electromagnetic Pulse attack) or natural disasters (such as solar flares, earthquakes, and floods). Such events happen at specific geographical locations and disrupt specific parts of the network but their effects are not deterministic. Therefore, we provide a unified framework to model the network vulnerability when the event has a probabilistic nature, defined by an arbitrary probability density function. Our framework captures scenarios with a number of simultaneous attacks, in which network components consist of several dependent subcomponents, and in which either a 1+1 or a 1:1 protection plan is in place. We use computational geometric tools to provide efficient algorithms to identify vulnerable points within the network under various metrics. Then, we obtain numerical results for specific backbone networks, thereby demonstrating the applicability of our algorithms to real-world scenarios. Our novel approach allows for identifying locations which require additional protection efforts (e.g., equipment shielding). Overall, the paper demonstrates that using computational geometric techniques can significantly contribute to our understanding of network resilience.

show abstract

Exact algorithms for solving a Euclidean maximum flow network interdiction problem

Sullivan

Smith

2014

Networks

View full text Add to dashboard Cite

We consider an interdiction problem that involves an operator (or defender) whose goal is to maximize flow from a source node to a sink node in some network that resides in Euclidean space. The problem we examine takes the perspective of an interdictor, who seeks to minimize the defender's maximum flow by locating a set of attacks that diminish arc capacities in accordance with the distance from the arc to the attack. Attacks are not restricted to node or arc locations, and can occur anywhere on the region in which the network is located. We refer to this problem as the Euclidean maximum flow network interdiction problem (E‐MFNIP). We show that E‐MFNIP is NP‐hard, as it generalizes the maximum flow interdiction problem studied by Wood . This article contributes two approaches to solving E‐MFNIP based on solving a sequence of lower‐bounding integer programs from which upper bounds can be readily obtained, and shows that these bounds are convergent. Computations on a set of test instances indicate that an approach based on space‐discretization tends to converge much faster than one based on linearizing the nonlinear capacity functions. We demonstrate the application of our space‐discretization approach on a real geographical network. © 2014 Wiley Periodicals, Inc. NETWORKS, Vol. 64(2), 109–124 2014

show abstract

Network vulnerability to single, multiple, and probabilistic physical attacks

Cited by 60 publications

References 24 publications

Future research directions in design of reliable communication systems

Future research directions in design of reliable communication systems

The resilience of WDM networks to probabilistic geographical failures

Exact algorithms for solving a Euclidean maximum flow network interdiction problem

Contact Info

Product

Resources

About