A family of algorithms for network reliability problems

IEEE International Conference on Communications

Volumn 4, Issue , 2002, Pages 2167-2173

  Shaio, Jack ^a  

^a Vivace Network Inc ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; FAILURE ANALYSIS; GENETIC ALGORITHMS; MATHEMATICAL MODELS; OPTIMIZATION; RELIABILITY; TELECOMMUNICATION TRAFFIC; TOPOLOGY;

MULTICOMMODITY FLOW FEASIBILITY; NETWORK RELIABILITY;

COMPUTER NETWORKS;

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

References (24)

1. Multicommodity network flows - A survey
2. Multicommodity flows - A state of the art survey
3. Augmented lagrangean based algorithms for centralized network design, 1983
4. Lagrangean relaxation method for solving integer linear programming problems
5. Validation of subgradient optimization
6. Network synthesis and dynamic network optimization
7. Subgradient optimization and large scale programming: An application to network synthesis with security constraints
8. Optimum synthesis of a network with non-simultaneous multicommodity flow requirements
9. On an extension of the maximum-flow minimum-cut theorem to multicommodity flows
10. Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks
11. Comparative methods and issues in design of mesh-restorable STM and ATM networks
12. Multicommodity capacitated network design
13. Design and dimensioning of survivable SDH/SONET networks
14. Design of survivable networks
15. Multiprotocol label switching architecture
16. Requirements for traffic engineering over MPLS
17. Approximation algorithms for restoration capacity planning
18. Constraint generation for network reliability problems
19. A virtual path routing algorithm for ATM networks based on the equivalent bandwidth method
20. Fault tolerant design of wavelength-routed optical networks