Algorithms for budget-constrained survivable topology design

IEEE International Conference on Communications

Volumn 4, Issue , 2002, Pages 2162-2166

  Garg, Nikhil ^a   Simha, Rahul ^a   Xing, Wenxun ^a  

^a George Washington University   (United States)

Author keywords

Graph augmentation; Reliability; Survivable network design; Topology design

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; CONSTRAINT THEORY; GRAPH THEORY; HEURISTIC METHODS; POLYNOMIAL APPROXIMATION; RELIABILITY;

BICONNECTIVITY; SURVIVABLE NETWORK DESIGN;

COMPUTER NETWORKS;

EID: 0036279692     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Constrained length connectivity and survivable networks
2. Two-path subsets: Efficient counting and applications to performability analysis
3. SONET toolkit: A decision support system for designing robust and cost-effective fiber-optic networks
4. Augmentation problems
5. Optical layer survivability: A service perspective
6. Optimal augmentation to make a graph k-edge-connected and triconnected
7. Computer solutions of the traveling salesman problem
8. Evaluating network reliability and 2-edge-connected reliability in linear time for bounded path-width graphs
9. Methods for designing communication networks with certain two-connected survivability constraints
10. Design of communication networks with Survivability constraints
11. Survivable network design: The state of the art
12. The design of minimum-cost survivable networks