An integrated system for designing minimum cost survivable telecommunications networks

IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans.

Volumn 26, Issue 6, 1996, Pages 856-862

  Clarke, Lloyd W ^a   Anandalingam, G ^b  

^a Georgia Institute of Technology   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL CAPACITY; COMPUTATIONAL COMPLEXITY; COST EFFECTIVENESS; ELECTRIC NETWORK TOPOLOGY; HEURISTIC METHODS; SYSTEMS ANALYSIS; TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC;

COST SURVIVABLE TELECOMMUNICATIONS NETWORKS; DESIGN SYSTEM; SURVIVABILITY;

TELECOMMUNICATION NETWORKS;

EID: 0030287812     PISSN: 10834427     EISSN: None     Source Type: Journal    
DOI: 10.1109/3468.541346     Document Type: Article

References (17)

1. Y. K. Agarwal, "An algorithm for designing survivable networks," AT&T Tech. J., pp. 64-76, 1989.
2. L. W. Clarke, "The design of survivable networks," Ph.D. Dissertation, The University of Pennsylvania, Philadelphia, 1992.
3. L. W. Clarke and G. Anandalingam, "A bootstrap heuristic for designing minimum cost survivable networks," Comp. Oper. Res., vol. 22, no. 9, pp. 921-934, 1994.
4. B. Gavish, P. Trudeau, M. Dror, M. Gendreau, and L. Mason, "Fiberoptic circuit network design under reliability constraints," IEEE J. Select. Areas Commun., vol. 7, no. 8, pp. 1181-1187, Oct. 1989.
5. M. Grötschel, C. Monma, and M. Stoer, "Computational results with a cutting plane algorithm for designing communication net works with low-connectivity constraints," Oper. Res., vol. 40, no. 2, pp. 309-330, 1992.
6. _, "Facets for polyhedra arising in the design of communication networks with low-connectivity constraints," SIAM J. Optimization, vol. 2, no. 3, 1992.
7. Y. Kajitani and S. Ueno, "The minimum augmentation of a directed tree to a k-edge-connected directed graph," Networks, vol. 16, pp. 181-197, 1986.
8. R. M. Karp, "On the complexity of combinatorial problems," Networks, vol. 5, pp. 45-68, 1975.
9. L. J. LeBlanc and R. Reddoch, "Reliable link topology/capacity design and routing in backbone telecommunication networks," Working Paper 90-08, Owen Graduate School of Management, Vanderbilt University, Nashville, TN 37203, Jan. 1990.
10. C. Monma and D. Shallcross, "Methods of designing survivable communication networks," Oper. Res., vol. 37, pp. 531-541, 1989.
11. K. Newport, "Incorporating survivability considerations directly into the network design process," in IEEE INFOCOM'90, pp. 215-220, 1990.
12. N. Robertson and P. D. Seymour, "Disjoint paths - a survey," SIAM J. Algebraic and Discrete Methods, vol. 6, no. 2, pp. 300-305, Apr. 1985.
13. U. Schumacher, "An algorithm for construction of a k-connected graph with minimum number of edges and quasiminimal diameter," Networks, vol. 14, pp. 63- 74, 1984.
14. K. Steiglitz, P. Weiner, and D. Kleitman, "The design of minimum-cost survivable networks," IEEE Trans. Circuit Theory, vol. CT-16, nol. 4, pp. 455-460, Nov. 1969.
15. J. Suurballe, "Disjoint paths in a network," Networks, vol. 4, pp. 125-145, 1974.
16. J. Suurballe and R. Tarjan, "A quick method for finding shortest pairs of disjoint paths," Networks, vol. 14, pp. 325-336, 1984.
17. S. Ueno, Y. Kajitani, and H. Wada, "Minimum augmentation of a tree to a k-edge-connected graph," Networks, vol. 18, pp. 19-25, 1988.