Design method of robust networks against performance deterioration during failures

Authors:
Nozomu Katayama;Takeshi Fujimura;Hiroyoshi Miwa;Noriaki Kamiyama;Haruhisa Hasegawa;Hideaki Yoshino
Affiliations:
Kwansei Gakuin University, Hyogo, Japan;Kwansei Gakuin University, Hyogo, Japan;Kwansei Gakuin University, Hyogo, Japan;NTT Service Integration Laboratories, Tokyo, Japan;NTT Service Integration Laboratories, Tokyo, Japan;NTT Service Integration Laboratories, Tokyo, Japan
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 7
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Algorithmics for Hard Problems

Algorithmics for Hard Problems
Network topology generators: degree-based vs. structural

Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Hardness of Approximation for Vertex-Connectivity Network-Design Problems

APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs

Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Augmenting graphs to meet edge-connectivity requirements

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Augmenting forests to meet odd diameter requirements

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

When a link or node failure occurs in a network, flows are detoured and therefore the hop counts of the flows increase. This increase could drastically deteriorate the quality of a network. The flow hop length stability as well as network connectivity is important for network reliability. We investigate a network design method that improves stability and connectivity of a network during a failure with a limited investment cost. We formalize a network design problem, prove that this problem is NP-complete, and propose an approximation algorithm. In addition, we evaluate the performance of the algorithm by using publicly available data for 39 backbone networks of commercial ISPs and networks generated by two well-known models. The results show that the proposed algorithm provides effective solutions from a practical viewpoint in sufficiently small computation time.