Approximability status of Survivable Network problems
نویسنده
چکیده
In Survivable Network problems (a.k.a. Survivable Network Design Problem – SNDP) we are given a graph with costs/weights on edges and/or nodes and prescribed connectivity requirements/demands. Among the subgraphs of G that satisfy the requirements, we seek to find one of minimum cost. Formally, the problem is defined as follows. Given a graph G = (V,E) and Q ⊆ V , the Q-connectivity λQG(uv) of uv in G is the maximum number of edge-disjoint uv-paths such that no two of them have a node in Q − {u, v} in common. The case S = ∅ is just the edge-connectivity when the paths should be edge-disjoint, and the case S = V is just the node-connectivity when the paths should be internally node-disjoint.
منابع مشابه
Survivable Probability of Network Slicing with Random Physical Link Failure
The fifth generation of communication technology (5G) revolutionizes mobile networks and the associated ecosystems through the integration of cross-domain networks. Network slicing is an enabling technology for 5G as it provides dynamic, on-demand, and reliable logical network slices (i.e., network services) over a common physical network/infrastructure. Since a network slice is subject to fail...
متن کاملDiversity coding-based survivable routing with QoS and differential delay bounds
Survivable routing with instantaneous recovery gained much attention in the last decade, as in optical backbone networks even the shortest disruption of a connection may cause tremendous loss of data. Recently, strict delay requirements emerges with the growing volume of multimedia and video streaming applications, which have to be ensured both before and after a failure. Diversity coding provi...
متن کاملA Fast Strategy to Find Solution for Survivable Multicommodity Network
This paper proposes an immediately efficient method, based on Benders Decomposition (BD), for solving the survivable capacitated network design problem. This problem involves selecting a set of arcs for building a survivable network at a minimum cost and within a satisfied flow. The system is subject to failure and capacity restriction. To solve this problem, the BD was initially proposed with ...
متن کاملHardness of Approximation for Vertex-Connectivity Network-Design Problems
In the survivable network design problem (SNDP), the goal is to find a minimum-cost spanning subgraph satisfying certain connectivity requirements. We study the vertex-connectivity variant of SNDP in which the input specifies, for each pair of vertices, a required number of vertex-disjoint paths connecting them. We give the first strong lower bound on the approximability of SNDP, showing that t...
متن کاملApproximation Algorithms for Survivable Optical Networks
We are motivated by the developments in all-optical networks { a new technology that supports high bandwidth demands. These networks provide a set of lightpaths which can be seen as high-bandwidth pipes on which communication is performed. Since the capacity enabled by this technology substantially exceeds the one provided by conventional networks, its ability to recover from failures within th...
متن کامل