Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Some generalized max-flow min-cut problems in the plane
Mathematics of Operations Research
The network inhibition problem
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Implementing a fully polynomial time approximation scheme for all terminal network reliability
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Protection interoperability for WDM optical networks
IEEE/ACM Transactions on Networking (TON)
The Clarkson-Shor technique revisited and extended
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Survivable Networks: Algorithms for Diverse Routing
Survivable Networks: Algorithms for Diverse Routing
The Combinatorics of Network Reliability
The Combinatorics of Network Reliability
Translating a Planar Object to Maximize Point Containment
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
On approximating the depth and related problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Survivability and Traffic Grooming in WDM Optical Networks
Survivability and Traffic Grooming in WDM Optical Networks
Stabbing Convex Polygons with a Segment or a Polygon
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Scalability of network-failure resilience: analysis using multi-layer probabilistic graphical models
IEEE/ACM Transactions on Networking (TON)
Topology Design of Undersea Cables Considering Survivability Under Major Disasters
WAINA '09 Proceedings of the 2009 International Conference on Advanced Information Networking and Applications Workshops
Resilience in computer systems and networks
Proceedings of the 2009 International Conference on Computer-Aided Design
Region-based connectivity: a new paradigm for design of fault-tolerant networks
HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
Network reliability with geographically correlated failures
INFOCOM'10 Proceedings of the 29th conference on Information communications
On approximation of new optimization methods for assessing network vulnerability
INFOCOM'10 Proceedings of the 29th conference on Information communications
Resilient routing layers for network disaster planning
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
IEEE Journal on Selected Areas in Communications
Physical topology design for survivable routing of logical rings in WDM-based networks
IEEE Journal on Selected Areas in Communications
On new approaches of assessing network vulnerability: hardness and approximation
IEEE/ACM Transactions on Networking (TON)
Survivability in optical networks
IEEE Network: The Magazine of Global Internetworking
Geometric hitting sets and their variants
Geometric hitting sets and their variants
| Hi-index | 0.00 |
Telecommunications networks, and in particular optical WDM networks, are vulnerable to large-scale failures in 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 cannot be determined exactly in advance. Therefore, we provide a unified framework to model 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, when 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, demonstrating the applicability of our algorithms to real-world scenarios. Our novel approach allows to identify locations that 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.