An overview of algorithms for network survivability

Authors:
F. A. Kuipers
Affiliations:
Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, Delft, The Netherlands
Venue:
ISRN Communications and Networking
Year:
2012

Citing 83
Cited 0

Edge-connectivity augmentation problems

Journal of Computer and System Sciences
A new approach to the maximum-flow problem

Journal of the ACM (JACM)
An O(n2 log n) parallel max-flow algorithm

Journal of Algorithms
A data structure for dynamic trees

Journal of Computer and System Sciences
Isoperimetric numbers of graphs

Journal of Combinatorial Theory Series B
Improved time bounds for the maximum flow problem

SIAM Journal on Computing
Finding minimum-cost circulations by canceling negative cycles

Journal of the ACM (JACM)
Finding the edge connectivity of directed graphs

Journal of Algorithms
Sparsest cuts and bottlenecks in graphs

Discrete Applied Mathematics - Computational combinatiorics
The complexity of finding two disjoint paths with min-max objective function

Discrete Applied Mathematics
Generating pseudo-random permutations and maximum flow algorithms

Information Processing Letters
Finding disjoint paths in networks

SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Reducing edge connectivity to vertex connectivity

ACM SIGACT News
Applications of a poset representation to edge connectivity and graph rigidity

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Augmenting graphs to meet edge-connectivity requirements

SIAM Journal on Discrete Mathematics
Computing edge-connectivity in multigraphs and capacitated graphs

SIAM Journal on Discrete Mathematics
On a theorem of Mader

Discrete Mathematics - Special volume (part two) to mark the centennial of Julius Petersen's “Die theorie der regula¨ren graphs” (“The theory of regular graphs”)
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Approximation algorithms for graph augmentation

Journal of Algorithms
Finding a smallest augmentation to biconnect a graph

SIAM Journal on Computing
A minimum 3-connectivity augmentation of a graph

Journal of Computer and System Sciences
Augmenting undirected connectivity in RNC and in randomized Õ(n3) time

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On the optimal vertex-connectivity augmentation

Journal of Combinatorial Theory Series B
A matroid approach to finding edge connectivity and packing arborescences

Selected papers of the 23rd annual ACM symposium on Theory of computing
A Randomized Maximum-Flow Algorithm

SIAM Journal on Computing
Minimal edge-coverings of pairs of sets

Journal of Combinatorial Theory Series B
Improved approximation algorithms for uniform connectivity problems

Journal of Algorithms
Approximation algorithms for finding highly connected subgraphs

Approximation algorithms for NP-hard problems
Improved approximation algorithms for weighted 2-and 3-vertex connectivity augmentation problems

Journal of Algorithms
A Fast Algorithm for Optimally Increasing the Edge Connectivity

SIAM Journal on Computing
A note on the vertex-connectivity augmentation problem

Journal of Combinatorial Theory Series B
Beyond the flow decomposition barrier

Journal of the ACM (JACM)
Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs

IEEE/ACM Transactions on Networking (TON)
Minimum cuts in near-linear time

Journal of the ACM (JACM)
Fast algorithms for k-shredders and k-node connectivity augmentation

Journal of Algorithms
Building chain and cactus representations of all minimum cuts from Hao-Orlin in the same asymptotic run time

Journal of Algorithms
Computing vertex connectivity: new bounds from old techniques

Journal of Algorithms
Augmenting undirected edge connectivity in Õ(n2) time

Journal of Algorithms
Survivable Networks: Algorithms for Diverse Routing

Survivable Networks: Algorithms for Diverse Routing
The Combinatorics of Network Reliability

The Combinatorics of Network Reliability
Graph Algorithms

Graph Algorithms
An efficient primary-segmented backup scheme for dependable real-time communication in multihop networks

IEEE/ACM Transactions on Networking (TON)
A Near Optimal Algorithm for Vertex Connectivity Augmentation

ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Path-protection routing and wavelength assignment (RWA) in WDM mesh networks under duct-layer constraints

IEEE/ACM Transactions on Networking (TON)
Graph connectivity and its augmentation: applications of MA orderings

Discrete Applied Mathematics
On the complexity of vertex-disjoint length-restricted path problems

Computational Complexity
Independence free graphs and vertex connectivity augmentation

Journal of Combinatorial Theory Series B
Reliability constrained routing in QoS networks

IEEE/ACM Transactions on Networking (TON)
Using expander graphs to find vertex connectivity

Journal of the ACM (JACM)
Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking

Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking
On shredders and vertex connectivity augmentation

Journal of Discrete Algorithms
Linear time distributed construction of colored trees for disjoint multipath routing

Computer Networks: The International Journal of Computer and Telecommunications Networking
The power of tuning: a novel approach for the efficient design of survivable networks

IEEE/ACM Transactions on Networking (TON)
Determining edge connectivity in 0(nm)

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Graph transformation approaches for diverse routing in shared risk resource group (SRRG) failures

Computer Networks: The International Journal of Computer and Telecommunications Networking
On four-connecting a triconnected graph

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Faster algorithms for construction of recovery trees enhancing QoP and QoS

IEEE/ACM Transactions on Networking (TON)
Routing connections with differentiated reliability requirements in WDM mesh networks

IEEE/ACM Transactions on Networking (TON)
Introduction to Algorithms, Third Edition

Introduction to Algorithms, Third Edition
Approximating connectivity augmentation problems

ACM Transactions on Algorithms (TALG)
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
Designing low-capacity backup networks for fast restoration

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
How reliable can two-path protection be?

IEEE/ACM Transactions on Networking (TON)
Diverse routing in networks with probabilistic failures

IEEE/ACM Transactions on Networking (TON)
Graph Spectra for Complex Networks

Graph Spectra for Complex Networks
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs

Proceedings of the forty-third annual ACM symposium on Theory of computing
Cross-layer survivability in WDM-based networks

IEEE/ACM Transactions on Networking (TON)
Survivable impairment-aware traffic grooming in WDM rings

Proceedings of the 23rd International Teletraffic Congress
A comparison of exact and ε-approximation algorithms for constrained routing

NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Property Testing on k-Vertex-Connectivity of Graphs

Algorithmica
Dinitz' algorithm: the original version and even's version

Theoretical Computer Science
A comparative analysis of network dependability, fault-tolerance, reliability, security, and survivability

IEEE Communications Surveys & Tutorials
A survey of resilience differentiation frameworks in communication networks

IEEE Communications Surveys & Tutorials
p-Cycles: An overview

IEEE Communications Surveys & Tutorials
Distributed algorithms for computing shortest pairs of disjoint paths

IEEE Transactions on Information Theory
Maximum algebraic connectivity augmentation is NP-hard

Operations Research Letters
An algorithm to increase the node-connectivity of a digraph by one

Discrete Optimization
A simple version of Karzanov's blocking flow algorithm

Operations Research Letters
A simple version of Karzanov's blocking flow algorithm

Operations Research Letters
Protection cycles in mesh WDM networks

IEEE Journal on Selected Areas in Communications
Quality-of-service and quality-of-protection issues in preplanned recovery schemes using redundant trees

IEEE Journal on Selected Areas in Communications
Reliability in layered networks with random link failures

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Network survivability--the ability to maintain operation when one or a few network components fail--is indispensable for present-day networks. In this paper, we characterize three main components in establishing network survivability for an existing network, namely, (1) determining network connectivity, (2) augmenting the network, and (3) finding disjoint paths. We present a concise overview of network survivability algorithms, where we focus on presenting a few polynomial-time algorithms that could be implemented by practitioners and give references to more involved algorithms.