Design of survivable networks with connectivity requirements

Telecommunication Systems

Volumn 20, Issue 1-2, 2002, Pages 133-149

  Soni, Samit ^a   Pirkul, Hasan ^b  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF TEXAS AT DALLAS   (United States)

Author keywords

Constraint addition; Network design

Indexed keywords

CONSTRAINT THEORY; COST EFFECTIVENESS; INTEGER PROGRAMMING; PROBLEM SOLVING;

CONSTRAINT ADDITION;

TELECOMMUNICATION NETWORKS;

EID: 0036265448     PISSN: 10184864     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1015445501694     Document Type: Article

References (30)

1. J.A. Abraham, An improved algorithm for network reliability, IEEE Transactions on Reliability 28 (1979) 58-61.
2. K.K. Aggarwal and S. Rai, Reliability evaluation in computer communication networks, IEEE Transactions on Reliability 30 (1981) 32-35.
3. K. Altinkemer and B. Gavish, Augmented Lagrangean method for routing in frame and cell relay networks with time restrictions, in: Proc. of the 4th Internat. Conf. on Telecommunications Systems Modeling and Analysis, 1996, pp. 285-294.
4. A. Balakrishnan, T.L. Magnanti and P. Mirchandani, Designing hierarchical survivable networks, Operations Research 46(1) (1998) 116-136.
5. M.O. Ball, Computing network reliability, Operations Research 27(4) (1979) 823-838.
6. F.T. Boesch and A.P. Felzer, On the invulnerability of the regular complete k-partite graphs, SIAM Journal on Applied Mathematics 20 (1971) 321-324.
7. F.T. Boesch and A.P. Felzer, On the minimum m-degree vulnerability criterion, IEEE Transactions on Circuit Theory 18 (1971) 224-228.
8. F.T. Boesch and R.E. Thomas, On graphs of invulnerable communication nets, IEEE Transactions on Circuit Theory 17 (1970) 183-191.
9. R.H. Cardwell, C.L. Monma and T.H. Wu, Computer-aided design procedures for survivable fiber optic networks, IEEE Journal on Selected Areas in Communications 3(8) (1989) 1188-1197.
10. J. Cavers, Cutset manipulation for communication and networks reliability and estimation, IEEE Transactions on Communications 23 (1975) 569-575.
11. L.W. Clarke and G. Anandalingam, A bootstrap heuristic for designing minimum cost survivable networks, Computers and Operations Research 22(9) (1995) 921-934.
12. L.W. Clarke and G. Anandalingam, An integrated system for designing minimum cost survivable telecommunication networks, IEEE Transactions on Systems, Man and Cybernetics 26(6) (1996) 856-862.
13. G. Dahl, The design of survivable directed networks, Telecommunication Systems 2 (1994) 349-377.
14. H. Frank and I.T. Frisch, Analysis and design of survivable networks, IEEE Transactions on Communications 18 (1970) 501-519.
15. H. Frank, I.T. Frisch and W. Chou, Topological considerations in the design of the ARPA computer network, in: 1970 Spring Joint Computing Conference, AFIPS Conference Proceedings 36 (1970).
16. B. Gavish, Augmented Lagrangean based algorithms for centralized network design, IEEE Transactions on Communications 33(12) (1983) 1247-1257.
17. B. Gavish and I. Neuman, Routing in a network with unreliable components, IEEE Transactions on Communications 40 (1992) 1248-1257.
18. M. Grötschel, C.L. Monma and M. Stoer, Polyhedral approaches to network survivability in: DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 5 (Amer. Math. Soc., Providence, RI, 1991) pp. 121-141.
19. M. Grötschel, C.L. Monma and M. Stoer, Facets for polyhedra arising in the design of communication network with low-connectivity constraints, SIAM Journal on Optimization 2 (1992) 474-504.
20. M. Grötschel, C.L. Monma and M. Stoer, Computational results with a cutting plane algorithm for designing communication networks with low connectivity constraints, Operations Research 40 (1992) 309-330.
21. M. Grötschel, C.L. Monma and M. Stoer, Polyhedral and computational investigations for designing communication networks with high survivability requirements, Operations Research 43 (1995) 1012-1024.
22. H. Jan, Design of reliable networks, Computers and Operations Research 20(1) (1993) 25-34.
23. P. Kubat, Reliability analysis for integrated networks with application to burst switching, IEEE Transactions on Communications 34 (1986) 564-568.
24. V.O.K. Li and J.A. Silvester, Performance analysis of networks with unreliable components, IEEE Transactions on Communications 32 (1984) 1105-1110.
25. T.L. Magnanti and S. Raghavan, Strong formulations for network design problems with connectivity problems, Technical Report, Operations Research Center, MIT, Cambridge, MA (1997).
26. C.L. Monma and D.F. Shallcross, Methods for designing communications networks with certain two connected survivability, Operations Research 37(4) (1989) 531-541.
27. R. Patterson, R. Gupta and R. Chandrasekaran, Integer programming by constraint addition: Design of minimum cost connected rings with minimum-coverage requirements, Working paper No. WP1998-005, University of Texas at Dallas, School of Management, Center for Advanced Information and Telecommunication Technology Applications.
28. S. Raghavan, Formulations and algorithms for network design problems with connectivity requirements, Ph.D. thesis, Massachusetts Institute of Technology (1995).
29. A. Satyanarayana and A. Prabhakar, New topological formula and rapid algorithm for topological analysis of complex networks, IEEE Transactions on Reliability 27 (1978) 82-100.
30. A. Shogan, Sequential bounding of the reliability of a stochastic network, Operations Research 24(6) (1976) 1027-1044.