Constructing min-cost single failure immune recovery trees: Computational complexity and approximation algorithms

Xi Fang, Dejun Yang, Guoliang Xue, Krishnaiyan Thulasiraman

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we study the problem of constructing min-cost single-link/node failure immune recovery trees for two-edge/vertex connected networks. We prove its NP-hardness, and present a general framework of efficient approximation algorithms for solving this problem. Based on this framework, we present two realizations: 1) for link failure protection, our realization has an approximation ratio of 2 and O(nlog n(m +nlogn)) running time if different links have different costs, or an approximation ratio of 1.5 and a linear running time if all links have the same cost; 2) for node failure protection, our realization has an approximation ratio of 2 and O(n3m) running time if different links have different costs, or an approximation ratio of 5/3 and a linear running time if all links have the same cost.

Original languageEnglish (US)
Title of host publicationInternational Symposium on Advanced Networks and Telecommunication Systems, ANTS
Pages55-57
Number of pages3
DOIs
StatePublished - 2010
Event2010 IEEE 4th International Symposium on Advanced Networks and Telecommunication Systems, ANTS 2010 - Mumbai, India
Duration: Dec 16 2010Dec 18 2010

Other

Other2010 IEEE 4th International Symposium on Advanced Networks and Telecommunication Systems, ANTS 2010
CountryIndia
CityMumbai
Period12/16/1012/18/10

Fingerprint

Approximation algorithms
Computational complexity
Recovery
costs
Costs
Hardness
time

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Communication

Cite this

Fang, X., Yang, D., Xue, G., & Thulasiraman, K. (2010). Constructing min-cost single failure immune recovery trees: Computational complexity and approximation algorithms. In International Symposium on Advanced Networks and Telecommunication Systems, ANTS (pp. 55-57). [5983527] https://doi.org/10.1109/ANTS.2010.5983527

Constructing min-cost single failure immune recovery trees : Computational complexity and approximation algorithms. / Fang, Xi; Yang, Dejun; Xue, Guoliang; Thulasiraman, Krishnaiyan.

International Symposium on Advanced Networks and Telecommunication Systems, ANTS. 2010. p. 55-57 5983527.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Fang, X, Yang, D, Xue, G & Thulasiraman, K 2010, Constructing min-cost single failure immune recovery trees: Computational complexity and approximation algorithms. in International Symposium on Advanced Networks and Telecommunication Systems, ANTS., 5983527, pp. 55-57, 2010 IEEE 4th International Symposium on Advanced Networks and Telecommunication Systems, ANTS 2010, Mumbai, India, 12/16/10. https://doi.org/10.1109/ANTS.2010.5983527
Fang X, Yang D, Xue G, Thulasiraman K. Constructing min-cost single failure immune recovery trees: Computational complexity and approximation algorithms. In International Symposium on Advanced Networks and Telecommunication Systems, ANTS. 2010. p. 55-57. 5983527 https://doi.org/10.1109/ANTS.2010.5983527
Fang, Xi ; Yang, Dejun ; Xue, Guoliang ; Thulasiraman, Krishnaiyan. / Constructing min-cost single failure immune recovery trees : Computational complexity and approximation algorithms. International Symposium on Advanced Networks and Telecommunication Systems, ANTS. 2010. pp. 55-57
@inproceedings{dfdbc4b0334849e9bf2af4b11054d11d,
title = "Constructing min-cost single failure immune recovery trees: Computational complexity and approximation algorithms",
abstract = "In this paper, we study the problem of constructing min-cost single-link/node failure immune recovery trees for two-edge/vertex connected networks. We prove its NP-hardness, and present a general framework of efficient approximation algorithms for solving this problem. Based on this framework, we present two realizations: 1) for link failure protection, our realization has an approximation ratio of 2 and O(nlog n(m +nlogn)) running time if different links have different costs, or an approximation ratio of 1.5 and a linear running time if all links have the same cost; 2) for node failure protection, our realization has an approximation ratio of 2 and O(n3m) running time if different links have different costs, or an approximation ratio of 5/3 and a linear running time if all links have the same cost.",
author = "Xi Fang and Dejun Yang and Guoliang Xue and Krishnaiyan Thulasiraman",
year = "2010",
doi = "10.1109/ANTS.2010.5983527",
language = "English (US)",
isbn = "9781424498543",
pages = "55--57",
booktitle = "International Symposium on Advanced Networks and Telecommunication Systems, ANTS",

}

TY - GEN

T1 - Constructing min-cost single failure immune recovery trees

T2 - Computational complexity and approximation algorithms

AU - Fang, Xi

AU - Yang, Dejun

AU - Xue, Guoliang

AU - Thulasiraman, Krishnaiyan

PY - 2010

Y1 - 2010

N2 - In this paper, we study the problem of constructing min-cost single-link/node failure immune recovery trees for two-edge/vertex connected networks. We prove its NP-hardness, and present a general framework of efficient approximation algorithms for solving this problem. Based on this framework, we present two realizations: 1) for link failure protection, our realization has an approximation ratio of 2 and O(nlog n(m +nlogn)) running time if different links have different costs, or an approximation ratio of 1.5 and a linear running time if all links have the same cost; 2) for node failure protection, our realization has an approximation ratio of 2 and O(n3m) running time if different links have different costs, or an approximation ratio of 5/3 and a linear running time if all links have the same cost.

AB - In this paper, we study the problem of constructing min-cost single-link/node failure immune recovery trees for two-edge/vertex connected networks. We prove its NP-hardness, and present a general framework of efficient approximation algorithms for solving this problem. Based on this framework, we present two realizations: 1) for link failure protection, our realization has an approximation ratio of 2 and O(nlog n(m +nlogn)) running time if different links have different costs, or an approximation ratio of 1.5 and a linear running time if all links have the same cost; 2) for node failure protection, our realization has an approximation ratio of 2 and O(n3m) running time if different links have different costs, or an approximation ratio of 5/3 and a linear running time if all links have the same cost.

UR - http://www.scopus.com/inward/record.url?scp=80052867903&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80052867903&partnerID=8YFLogxK

U2 - 10.1109/ANTS.2010.5983527

DO - 10.1109/ANTS.2010.5983527

M3 - Conference contribution

AN - SCOPUS:80052867903

SN - 9781424498543

SP - 55

EP - 57

BT - International Symposium on Advanced Networks and Telecommunication Systems, ANTS

ER -