Design of Communication Networks with Survivability Constraints

References

• Ball M. O., Provan J. S. Calculating bounds on reachability and connectedness in stochastic networks. Networks (1983) 13:253–278Crossref, Google Scholar
• Bixby R. E. The minimum number of edges and vertices in a graph with edge connectivity n and mn-bonds. Networks (1975) 5:253–298Crossref, Google Scholar
• Cardwell R. H., Monma C. L., Wu T. Computer-aided design procedures for survivable fiber optic networks. IEEE J. SAC (1989) 7:1188–1197Google Scholar
• Cosares S., Deutch N. D., Saniee I., Wasem O. J. SONET toolkit: A decision support system for designing robust and cost-effective fiber-optic networks. Interfaces (1995) 25:20–40Link, Google Scholar
• Dahlhaus E., Johnson D. S., Papadimitriou C. H., Seymour P. D., Yannakakis M. The complexity of multi-terminal cuts. SIAM J. Comput. (1994) 23:864–894Crossref, Google Scholar
• Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (Freeman, San Francisco, CA) Google Scholar
• Goemans M. X., Bertsimas D. J. Survivable networks, linear programming relaxations and the parsimonious property. Math. Programming (1993) 60:145–166Crossref, Google Scholar
• Gröstschel M., Monma C. L. Integer polyhedra arising from certain network design problems with connectivity constraints. SIAM J. Disc. Math. (1990) 3:502–524Crossref, Google Scholar
• Gröstschel M., Stoer C. L. Monma. M. Facets for polyhedra arising in the design of communication networks with low-connectivity constraints. SIAM J. Optim. (1992a) 2:474–504Crossref, Google Scholar
• Gröstschel M., Stoer C. L. Monma. M. Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints. Oper. Res. (1992b) 40:309–330Link, Google Scholar
• Gröstschel M., Stoer C. L. Monma. M., Ball M.O. Design of survivable networks. Network Models (1995) (North-Holland, Amsterdam)Crossref, Google Scholar
• Ko C. W., Monma C. L. Heuristic methods for designing highly survivable communications networks. (1989) . Technical report, BellcoreGoogle Scholar
• Kolar D. J., Wu T. A study of survivability versus cost for several fiber network architectures. Proc. IEEE Internat. Conf. Comm. (1988) 61–66Crossref, Google Scholar
• Kruskal J. B. On the shortest spanning tree of graph and the traveling salesman problem. Proc. Amer. Math. Soc. (1956) 7:48–50Crossref, Google Scholar
• Monma C. L., Shallcross D. F. Methods for designing communications networks with certain two-connected survivability constraints. Oper. Res. (1989) 37:531–541Link, Google Scholar
• Myung Y.-S., Kim H.-J., Tcha D.-W. Design of communication networks with survivability constraints. Proc. KTIS (1994) 94:42–46Google Scholar
• Nagamochi H., Ibaraki T. A Linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica (1992) 7:583–596Crossref, Google Scholar
• Nagamochi H., Sun Z., Ibaraki T. Counting the number of minimum cuts in undirected multigraphs. IEEE Trans. Reliability (1991) 40:610–614Crossref, Google Scholar
• Prim R. C. Shortest connection networks and some generalizations. Bell System Tech. J. (1957) 36:1389–1401Crossref, Google Scholar
• Wu T.Fiber Network Survivability (1992) (Artech House, Boston, MA) Google Scholar
• Wu T., Cardwell R. H., Woodall W. E. Decreasing survivable fiber network cost using optical switches. Proc. IEEE Internat. Conf. Comm. (1988) 93–97Google Scholar
• Wu T., Kolar D. J., Cardwell R. H. Survivable network architectures for broadband fiber optic networks: Model amd performance comparison. J. Lightwave Tech. (1988) 6:1698–1709Crossref, Google Scholar