Survivable Network Design: The State of the Art

Information Systems Frontiers

Volumn 1, Issue 3, 1999, Pages 303-315

  Soni, Samit ^a   Gupta, Rakesh ^b   Pirkul, Hasan ^b  

^a UNIVERSITY OF TEXAS AT DALLAS   (United States)

^b VANDERBILT UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033268277     PISSN: 13873326     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1010058513558     Document Type: Article

References (50)

1. Abraham JA. An Improved Algorithm for Network Reliability. IEEE Transactions on Reliability 1979;R-28:58-61.
2. Agarwal Y. An Algorithm for Designing Survivable Networks. AT&T Technical Journal 1989;64-76.
3. Aggarwal KK, Rai S. Reliability Evaluation in Computer Communication Networks. IEEE Transactions on Reliability 1981;R-30:32-35.
4. Alevras D, Grötschel M, Jonas P, Paul U, Wessaly R. Survivable Mobile Phone Network Architectures: Models and Solution Methods. IEEE Communications Magazine 1998;88-93.
5. Amiri A, Pirkul H. Primary and Secondary Route Selection in Backbone Communication Networks. European Journal of Operational Research 1996;93:98-109.
6. Anderson J, Doshi BT, Dravida S, Harshavardhana P. Fast Restoration of ATM Networks. IEEE Journal on Selected Areas in Communications 1994;12(1):128-138.
7. Balakrishnan A, Altinkemer K. Using a Hop Constrained Model to Generate Alternative Communications Network Design. ORSA Journal on Computing 1992;4:192-205.
8. Balakrishnan A, Magnanti TL, Mirchandani P. Designing Hierarchical Survivable Networks. Operations Research 1998;46(1):116-136.
9. Ball MO. Computing Network Reliability. Operations Research 1979;27(4):823-838.
10. Boesch FT, Felzer AP. On the Invulnerability of the Regular Complete k-Partite Graphs. SIAM Journal of Applied Mathematics 1971a;20:321-324.
11. Boesch FT, Felzer AP. On the Minimum m-Degree Vulnerability Criterion. IEEE Transactions on Circuit Theory 1971b;CT-18:224-228.
12. Boesch FT, Thomas RE. On Graphs of Invulnerability Communication Nets. IEEE Transactions on Circuit Theory 1971b;CT-17:183-191.
13. Cardwell RH, Monma CL, Wu TH. Computer-Aided Design Procedures for Survivable Fiber Optic Networks. IEEE Journal on Selected Areas in Communications 1989;3(8):1188-1197.
14. Cavers J. Cutset Manipulation for Communication and Networks Reliability and Estimation. IEEE Transactions on Communications 1975;COM-23:569-575.
15. Clarke LW, Anandalingam G. A Bootstrap Heuristic for Designing Minimum Cost Survivable Networks. Computers & Operations Research 1995;22(9):921-934.
16. Clarke LW, Anandalingam G. An integrated System for Designing Minimum Cost Survivable Telecommunication Networks. IEEE Transactions on Systems, Man and Cybernetics Part A: Systems & Human 1996;26(6):856-862.
17. Dahl G. The design of survivable directed networks. Telecommunication Systems 1994;2:349-377.
18. Frank H, Frisch IT. Analysis and Design of Survivable Networks. IEEE Transactions on Communications 1970;COM-18:501-519.
19. Frank H, Frisch IT, Chou W. Topological Considerations in the Design of the ARPA Computer Network. 1970 Spring Joint Computing Conference, AFIPS Conference Proceedings 1970;36.
20. Fujii H, Yoshikai N. Restoration Message Transfer Mechanism and Restoration Characteristics of Double-Search Self-Healing ATM Networks. IEEE Journal on Selected Areas in Communications 1994;12(1):149-157.
21. Gavish B, Neuman I. Routing in a Network with Unreliable Components. IEEE Transactions on Communications 1992;40:1248-1257.
22. Gavish B, Trudeau P, Dror M, Gendreau M, Lorne M. Fiber Optic Circuit Network Design under Reliability Constraints. IEEE Transactions on Selected Areas in Communications 1989;7:1181-1187.
23. Grötschel M, Monma CL, Stoer M. Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low Connectivity Constraints. Operations Research 1992b;40:309-330.
24. Grötschel M, Monma CL, Stoer M. Facets for polyhedra arising in the design of communication network with low-connectivity constraints. SIAM Journal on Optimization 1992a;2:474-504.
25. Grötschel M, Monma CL, Stoer M. Polyhedral Approaches to Network Survivability. DIMACS Series in Discrete Mathematics and Theoretical Computer Science AMS 1991;5:121-141.
26. Grötschel M, Monma CL, Stoer M. Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements. Operations Research 1995;43:1012-1024.
27. Hantler S, Milch D. Designing Reliable Networks with Short Paths. Telecommunication Systems 1993:43-50.
28. Jan RH. Design of Reliable Networks. Computers & Operations Research 1993;20(1):25-34.
29. Kajiyama Y, Tokura N, Kikuchi K. An ATM VP-Based Self-Healing Ring. IEEE Journal on Selected Areas in Communications 1994;12(1):171-177.
30. Kawamura R, Sato K, Tokizawa I. Self-Healing ATM Networks Based on Virtual Path Concept.
31. Kubat P. Reliability Analysis for Integrated Networks with Application to Burst Switching. IEEE Transactions on Communications 1986;COM-34:564-568.
32. Landegem TV, Vankwikelberge P, Vanderstraeten H. A Self-Healing ATM Network Based on Multi-link Principles. IEEE Journal on Selected Areas in Communications 1994;12(1):139-148.
33. LeBlanc L, Reddoch R. Reliable Routing and Design in Backbone Telecommunication Networks. Working Paper No. 90-08 (1993) Owen Graduate School of Management, Vanderbilt University, Nashville, TN 37203.
34. Li VOK, Silvester JA. Performance Analysis of Networks with Unreliable Components. IEEE Transactions on Communications 1984;COM-32:1105-1110.
35. Magnanti TL, Raghavan S. Strong Formulations for Network Design Problems with Connectivity Problems. Technical Report (1997), Operations Research Center, MIT, Cambridge, MA.
36. May KP, Semal P, Du Y, Hermann C. A Fast Restoration System for ATM-Ring-Based LANs. IEEE Communications Magazine 1995;90-98.
37. Medhi D. A Unified Approach to Network Survivability for Teletraffic Networks: Models, Algorithms and Analysis. IEEE Transactions of Communications 1994;42(2/3/4):534-548.
38. Monma CL, Shallcross DF. Methods for Designing Communications Networks with Certain Two Connected Survivability. Operations Research 1989;37(4):531-541.
39. Murakami K, Kim HS. Optimal Capacity and Flow Assignment for Self-Healing ATM Networks Based on Line and End-to-End Restoration. IEEE/ACM Transactions on Networking 1998,6(2):207-221.
40. Murakami K, Kim HS. Virtual Path Routing for Survivable ATM Networks. IEEE/ACM Transactions on Networking 1996;4(1):22-39.
41. Pirkul H, Narasimhan S. Primary and Secondary Route Selection in Backbone Computer Networks. ORSA Journal on Computing 1994;6(1):50-60.
42. Pirkul H, Soni S. New Formulations and Solution Procedures for the Hop Constrained Network Design Problem, under review at INFORMS Journal on Computing (1998).
43. Pirkul H, Soni S. The Design of Survivable Networks. Working Paper (1999) School of Management, the University of Texas at Dallas, Richardson, TX 75083-0688.
44. Raghavan S. Formulations and Algorithms for Network Design Problems with Connectivity Requirements. Ph.D. Thesis, Massachusetts Institute of Technology (1995).
45. Raghavendra CS, Hariri S. Reliability Optimization in the Design of Distributed Systems. IEEE Transactions on Software Engineering 1985;1184-1193.
46. Rosenberg E. A Nonlinear Programming Heuristic for Computing Optimal Link Capacities in a Multi-Hour Alternate Routing Communication Network. Operations Research 1987;35:354-364.
47. Rubin L. On Reliable Topological Structures for Message Switching Networks. IEEE Transactions on Communications 1978;COM-26:62-74.
48. Rubin L. The Delay Capacity Product for Message Switched Communication Networks. Journal of Combinatorics, Information Systems Science 1976;1(2)48-68.
49. Satyanarayana A, Prabhakar A. New Topological Formula and Rapid Algorithm for Topological Analysis of Complex Networks. IEEE Transactions on Reliability 1978;R-27:82-100.
50. Shogan AW. Sequential Bounding of the reliability of a Stochastic Network. Operations research 1978;34(6):1027-1044.