Approximate Algorithms for Survivable Network Design

Along with the rapid development of network communication technology and the explosive growth of the internet applications, network reliability appears increasingly important to both traditional areas such as defense, finance and power industry, and emerging areas such as trusted computing, cloud co...

Full description

Saved in:
Bibliographic Details
Published in:2012 Third International Conference on Networking and Computing pp. 9 - 18
Main Author: Hong Shen
Format: Conference Proceeding
Language:English
Published: IEEE 01.12.2012
Subjects:
Approximation algorithm
Approximation algorithms
Approximation methods
Cascading style sheets
connected spanning subgraph
disjoint path pair
Euler walk
High definition video
Optimization
Reliability
Steiner minimal network
survivable network design
terminal spanning-tree
Transforms
ISBN:1467346241, 9781467346245
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Along with the rapid development of network communication technology and the explosive growth of the internet applications, network reliability appears increasingly important to both traditional areas such as defense, finance and power industry, and emerging areas such as trusted computing, cloud computing and next-generation Internet. An interesting subject that has attracted great effort is how to design network topologies with a minimum network resource usage in terms of cost that provides a relibility guarantee. As problems on this subject, like most other network optimization problems, are well-known NP-hard even in their simplest form, design of effective solutions with a guaranteed approximation ratio from the optimal solution has been a major research focus of great significance for both theory and applications. This survery summarizes major existing techniques and results for solving some central problems in designing survivable networks including the minimal connected sub graph problem, the survivable network design problem and the Steiner minimal network problem.
ISBN:1467346241
9781467346245
DOI:10.1109/ICNC.2012.11