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
IDMaps: a global internet host distance estimation service
IEEE/ACM Transactions on Networking (TON)
Survivable Networks: Algorithms for Diverse Routing
Survivable Networks: Algorithms for Diverse Routing
Distributed Computing Network Reliability
Distributed Computing Network Reliability
A geographic directed preferential internet topology model
Computer Networks: The International Journal of Computer and Telecommunications Networking
Algorithms for Reporting and Counting Geometric Intersections
IEEE Transactions on Computers
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
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
Resilient routing layers for network disaster planning
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
Optical layer survivability: a services perspective
IEEE Communications Magazine
Survivable lightpath routing: a new approach to the design of WDM-based networks
IEEE Journal on Selected Areas in Communications
On the geographic location of Internet resources
IEEE Journal on Selected Areas in Communications
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
Survivability in optical networks
IEEE Network: The Magazine of Global Internetworking
Guest editorial - Protection, restoration, and disoster recovery
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
Communication networks are vulnerable to natural disasters, such as earthquakes or floods, as well as to physical attacks, such as an electromagnetic pulse (EMP) attack. Such real-world events happen in specific geographical locations and disrupt specific parts of the network. Therefore, the geographical layout of the network determines the impact of such events on the network's connectivity. In this paper, we focus on assessing the vulnerability of (geographical) networks to such disasters. In particular, we aim to identify the most vulnerable parts of the network. That is, the locations of disasters that would have the maximum disruptive effect on the network in terms of capacity and connectivity. We consider graph models in which nodes and links are geographically located on a plane. First, we consider a simplistic bipartite graph model and present a polynomial-time algorithm for finding a worst-case vertical line segment cut. We then generalize the network model to graphs with nodes at arbitrary locations.We model the disaster event as a line segment or a disk and develop polynomial-time algorithms that find a worst-case line segment cut and a worst-case circular cut. Finally, we obtain numerical results for a specific backbone network, thereby demonstrating the applicability of our algorithms to real-world networks. Our novel approach provides a promising new direction for network design to avert geographical disasters or attacks.