TY - GEN
T1 - Network vulnerability to single, multiple, and probabilistic physical attacks
AU - Agarwal, Pankaj K.
AU - Efrat, Alon
AU - Ganjugunte, Shashidhara K.
AU - Hay, David
AU - Sankararaman, Swaminathan
AU - Zussman, Gil
PY - 2010
Y1 - 2010
N2 - Telecommunications networks heavily rely on the physical infrastructure and, are therefore, vulnerable to natural disasters, such as earthquakes or floods, as well as to physical attacks, such as an Electromagnetic Pulse (EMP) attack. Largescale disasters are likely to destroy network equipment and to severely affect interdependent systems such as the power-grid. In turn, long-term outage of the power-grid might cause additional failures to the telecommunication network. In this paper, we model an attack as a disk around its epicenter, and provide efficient algorithms to find vulnerable points within the network, under various metrics. In addition, we consider the case in which multiple disasters happen simultaneously and provide an approximation algorithm to find the points which cause the most significant destruction. Finally, since a network element does not always fail, even when it is close to the attack's epicenter, we consider a simple probabilistic model in which the probability of a network element failure is given. Under this model, we tackle the cases of single and multiple attacks and develop algorithms that identify potential points where an attack is likely to cause a significant damage.
AB - Telecommunications networks heavily rely on the physical infrastructure and, are therefore, vulnerable to natural disasters, such as earthquakes or floods, as well as to physical attacks, such as an Electromagnetic Pulse (EMP) attack. Largescale disasters are likely to destroy network equipment and to severely affect interdependent systems such as the power-grid. In turn, long-term outage of the power-grid might cause additional failures to the telecommunication network. In this paper, we model an attack as a disk around its epicenter, and provide efficient algorithms to find vulnerable points within the network, under various metrics. In addition, we consider the case in which multiple disasters happen simultaneously and provide an approximation algorithm to find the points which cause the most significant destruction. Finally, since a network element does not always fail, even when it is close to the attack's epicenter, we consider a simple probabilistic model in which the probability of a network element failure is given. Under this model, we tackle the cases of single and multiple attacks and develop algorithms that identify potential points where an attack is likely to cause a significant damage.
KW - Computational geometry
KW - Electromagnetic Pulse (EMP)
KW - Geographic networks
KW - Network design
KW - Network survivability
UR - http://www.scopus.com/inward/record.url?scp=79951617247&partnerID=8YFLogxK
U2 - 10.1109/MILCOM.2010.5679556
DO - 10.1109/MILCOM.2010.5679556
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:79951617247
SN - 9781424481804
T3 - Proceedings - IEEE Military Communications Conference MILCOM
SP - 1824
EP - 1829
BT - 2010 IEEE Military Communications Conference, MILCOM 2010
T2 - 2010 IEEE Military Communications Conference, MILCOM 2010
Y2 - 31 October 2010 through 3 November 2010
ER -