An Algorithm for Designing Survivable Networks
Author:
- 6 May 1989
- journal article
- website
- Published by Institute of Electrical and Electronics Engineers (IEEE) in AT&T Technical Journal
- Vol. 68 (3) , 64-76
Abstract
In this paper, we consider the design of telecommunications networks using high-capacity transport facilities that can survive under a single-link failure scenario. The model considers three priority levels for circuits: high, normal, and low. Each h...Keywords
This publication has 10 references indexed in Scilit:
- Route selection in backbone data communication networksComputer Networks and ISDN Systems, 1988
- The minimum augmentation of a directed tree to a k‐edge‐connected directed graphNetworks, 1986
- A quick method for finding shortest pairs of disjoint pathsNetworks, 1984
- An Algorithm for Optimal Route Selection in SNA NetworksIEEE Transactions on Communications, 1983
- Solving the optimal network problemEuropean Journal of Operational Research, 1979
- Formulating and solving the network design problem by decompositionTransportation Research Part B: Methodological, 1979
- Multiflots de coût minimal avec fonctions de coût concavesAnnals of Telecommunications, 1976
- Disjoint paths in a networkNetworks, 1974
- Optimal Network Problem: A Branch-and-Bound AlgorithmEnvironment and Planning A: Economy and Space, 1973
- A note on two problems in connexion with graphsNumerische Mathematik, 1959