Finding Critical Regions and Region-Disjoint Paths in a Network
- 20 March 2014
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 23 (3), 908-921
- https://doi.org/10.1109/tnet.2014.2309253
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 nontrivial positions for such a figure needs to be considered and propose a corresponding polynomial-time 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.Keywords
Funding Information
- EU FP7 Network of Excellence in Internet Science EINS
- GigaPort3
This publication has 21 references indexed in Scilit:
- Union of random minkowski sums and network vulnerability analysisPublished by Association for Computing Machinery (ACM) ,2013
- The Resilience of WDM Networks to Probabilistic Geographical FailuresIEEE/ACM Transactions on Networking, 2013
- Geographic max-flow and min-cut under a circular disk failure modelPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2012
- On region-based fault tolerant design of distributed file storage in networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2012
- Fault-Tolerance in Sensor Networks: A New Evaluation MetricPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Link‐disjoint paths for reliable QoS routingInternational Journal of Communication Systems, 2003
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- A quick method for finding shortest pairs of disjoint pathsNetworks, 1984
- Disjoint paths in a networkNetworks, 1974
- A note on two problems in connexion with graphsNumerische Mathematik, 1959