Basic mathematical programming models for capacity allocation in mesh-based survivable networks

Omega

Volumn 35, Issue 6, 2007, Pages 629-644

  Kennington, Jeffery L ^a   Olinick, Eli V ^a   Spiride, Gheorghe ^b  

^a Southern Methodist University   (United States)

^b NORTEL NETWORKS   (United States)

Author keywords

Capacity analysis; Integer programming; LP; Mathematical programming; Optimization; Telecommunications

Indexed keywords

EID: 33847049932     PISSN: 03050483     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.omega.2006.04.011     Document Type: Article

References (80)

1. Cosares S., Deutsch D., Saniee I., and Wasem O. SONET toolkit: a decision support system for designing robust and cost-effective fiber-optic networks. Interfaces 25 (1995) 20-40
2. Klein J., and Powell P. Simple heuristic methods for network routeing: a case study. Omega 19 2-3 (1991) 137-148
3. Khuller S. Approximation algorithms for finding highly connected subgraphs. In: Hochbaum D. (Ed). Approximation algorithms for NP-hard problems (1997), PWS Publishing Company, Boston, MA 236-265
4. Grötschel M., Monma C., and Stoer M. Polyhedral and computational investigations for designing communication networks with high survivability requirements. Operations Research 43 6 (1995) 1012-1024
5. Soni S., Gupta R., and Pirkul H. Survivable network design: the state of the art. Information Systems Frontiers 1 3 (1999) 303-314
6. Fortz B., Labbé M., and Maffioli F. Solving the two-connected network with bounded meshes problem. Operations Research 48 (2000) 866-877
7. Fischer M., Garbin D., Harris T., and Knepley J. Large scale communications networks-design and analysis. Omega 6 (1978) 331-340
8. Ramaswami R., and Sivarajan K. Optical networks: a practical perspective (2002), Morgan Kaufman Publishers, Inc., New York, NY
9. Grover W. Case studies of survivable ring, mesh and mesh-arc-hybrid networks. Proceedings of IEEE GLOBECOM '92 1 (1992) 633-638
10. Slevinsky J, Grover W, MacGregor M. An algorithm for survivable network design employing multiple self-healing rings, Proceedings of IEEE GLOBECOM '93, 1993, p. 1568-73.
11. Grover W., Slevinsky J., and MacGregror M. Optimized design of ring-based survivable networks. Canadian Journal of Electrical and Computer Engineering 20 3 (1995) 139-149
12. Attanasio R., and Hoffman K. The right tool kit is all a network planner needs. Telephony 224 15 (1993) 22-26
13. Gardner L., Heydari M., Shah J., Sudborough I., Tollis I., and Xia C. Techniques for finding ring covers in survivable networks. Proceedings of IEEE GLOBECOM '94 3 (1994) 1862-1866
14. Wuttisittikulkij L, O'Mahony M. Design of a WDM network using a multiple ring approach, Proceedings of GLOBECOM '97, 1997, p. 551-5.
15. Wu T.-H. Fiber network service survivability (1992), Artech House, Inc., Norwood, MA
16. Chow T., and Lin P. The ring grooming problem. Networks 44 3 (2004) 194-202
17. Smith J., Schaefer A., and Yen J. A stochastic integer programming approach to solve a synchronous optical network ring design problem. Networks 44 1 (2004) 12-26
18. Kennington J., and Helgason R. Algorithms for network programming (1980), Wiley, New York, NY
19. Kennington J, Olinick E, Spiride G. Basic mathematical programming models for mesh-based survivable networks. Technical report 05-EMIS-02, Southern Methodist University, Dallas, TX 75275, 2005. Available online at 〈http://www.engr.smu.edu/∼olinick/webarchive/survey.pdf〉.
20. Dijkstra E. A note on two problems in connexion with graphs. Numerische Mathematik 1 (1959) 269-271
21. Whitler J. Telecommunications network design: optimization models and efficient algorithms. PhD thesis, School of Engineering and Applied Science, Southern Methodist University, Dallas, TX, 1997.
22. Kennington J., and Whitler J. An efficient decomposition algorithm to optimize spare capacity in a telecommunications network. INFORMS Journal on Computing 11 2 (1999) 149-160
23. Sakauchi H., Nishimura Y., and Hasegawa S. A self-healing network with an economical spare-channel assignment. Proceedings of the IEEE GLOBECOM '90 1 (1990) 438-443
24. Herzberg M. A decomposition approach to assign spare capacity channels in self-healing networks, Proceedings of IEEE GLOBECOM '93, 1993, p. 1601-5.
25. Chow C, Bicknell J, McCaughen S, Syed S. A fast distributed network restoration algorithm, In: Proceedings of the international phoenix conference on computer and communications, 1993, p. 1-7.
26. Helgason R., Kennington J., and Stewart B. Computational comparison of sequential and parallel algorithms for the one-to-one shortest path problem. Computational Optimization and Applications 1 (1993) 47-75
27. MacGregor M., and Grover W. Optimized k-shortest-paths algorithm for facility restoration. Software-Practice and Experience 24 9 (1994) 823-834
28. Herzberg M., and Bye S. An optimal spare capacity assignment model for survivable networks with hop limits. Proceedings of IEEE GLOBECOM '94 3 (1994) 1601-1606
29. Herzberg M., Bye S., and Utano A. The hop-limit approach for spare-capacity assignment in survivable networks. IEEE/ACM Transactions on Networking 3 6 (1995) 775-784
30. Dunn A., Grover W., and MacGregor M. Comparison of k-shortest paths and maximum flow routing for network facility restoration. IEEE Journal on Selected Areas in Communications 12 1 (1994) 88-99
31. Grover W, Stamatelakis D. Cycle-oriented distributed pre-configuration: ring-like speed with mesh-like capacity for self-planning network restoration, In: Proceedings IEEE international conference on communication '98, 1998, p. 537-43.
32. Stamatelakis D., and Grover W. IP layer restoration and network planning based on virtual protection cycles. IEEE JSCA Special Issue on Protocols and Architectures for Next Generation Optical WDM Networks 18 10 (2000) 1938-1949
33. Stamatelakis D., and Grover W. Theoretical underpinnings for the efficiency of restorable networks using pre-configured cycles ("p-cycles"). IEEE Transactions on Communications 48 8 (2000) 1262-1265
34. Grover W. Mesh-based survivable networks: options and strategies for optical, MPLS, SONET and ATM networks (2004), Prentice-Hall PTR, Upper Saddle River, NJ
35. Chujo T., Komine H., Miyazaki K., Ogura T., and Soejima T. Distributed self-healing network and its optimum spare-capacity assignment algorithm. Electronics and Communications in Japan 74 1 (1991) 479-486
36. Doverspike R., and Wilson B. Comparison of capacity efficiency of DCS network restoration routing techniques. Journal of Network and Systems Management 2 2 (1994) 95-123
37. Iraschko R, MacGregor M, Grover W. Optimal capacity placement for path restoration mesh survivable networks. In IEEE international communications and conference (ICC'96), vol. 3, 1996, p. 1568-74.
38. Iraschko R., MacGregor M., and Grover W. Optimal capacity placement for path restoration in STM or ATM mesh survivable networks. IEEE/ACM Transactions on Networking 6 3 (1998) 325-336
39. Murakami M, Kim H. Comparative study on restoration schemes of survivable ATM networks, In: Proceedings of the IEEE INFOCOM '97, vol. 1, 1997, p. 345-52.
40. Xiong Y., and Mason L. Restoration strategies and spare capacity requirements in self-healing ATM networks. IEEE/ACM Transactions on Networking 7 1 (1999) 98-110
41. Murakami K, Kim H. Joint optimization of capacity and flow assignment for self-healing ATM networks, In: IEEE international conference on communications, 1995, pages 216-220.
42. Murakami K., and Kim H. Optimal capacity and flow assignment for self-healing ATM networks based on line and end-to-end restoration. IEEE/ACM Transaction on Networking 6 2 (1998) 207-221
43. Saito H, Miyao Y, Komine T, Kubota F. Joint capacity assignment to state-independent working and spare paths for enhanced network survivability, In: Proceedings of IEEE international conference on communications, vol. 3, 1998, p. 1743-8.
44. Kennington J., Lewis K., Olinick E., Ortynski A., and Spiride G. Robust solutions for the WDM routing and provisioning problem: Models and algorithms. Optical Networks Magazine 4 2 (2003) 74-84
45. Birkan G., Kennington J., Olinick E., Ortynski A., and Spiride G. Making a case for using integer programming to design DWDM networks. Optical Networks Magazine 4 6 (2003) 107-120
46. Anderson J., Doshi B., Dravida S., and Harshavardhana P. Fast restoration of ATM networks. IEEE Journal on Selected Areas in Communications 12 1 (1994) 128-138
47. Kawamura R., Sato K., and Tokizawa I. Self-healing ATM networks based on virtual path concept. IEEE Journal on Selected Areas in Communications 12 1 (1994) 120-127
48. Murakami K., and Kim H. Virtual path routing for survivable ATM networks. IEEE/ACM Transactions on Networking 4 1 (1996) 22-39
49. Gavish B., and Neuman I. A system for routing and capacity assignment in computer communication networks. IEEE Transactions on Communications 37 4 (1989) 360-366
50. Doverspike R., Morgan J., and Leland W. Network design sensitivity studies for use of digital cross-connect systems in survivable network architectures. IEEE Journal on Selected Areas in Communications 12 1 (1994) 69-78
51. Kershenbaum A., Kermani P., and Grover G. MENTOR: an algorithm for mesh network topological optimization and routing. IEEE Transactions on Communications 39 4 (1991) 503-513
52. MacGregor M, Grover W. Investigation of a cut-tree approach to network restoration from node loss. In: IEEE international conference on communications, vol. 3, 1995, p. 1530-5.
53. Sen S., Doverspike R., and Cosares S. Network planning with random demand. Telecommunication Systems 3 (1994) 11-30
54. Andrade R., Lisser A., Maculan N., and Plateau G. Telecommunication network capacity design for uncertain demand. Computational Optimization and Applications 29 (2004) 127-146
55. Mulvey J., Vanderbei R., and Zenios S. Robust optimization of large-scale systems. Operations Research 43 2 (1995) 264-281
56. Laguna M. Applying robust optimization to capacity expansion of one location in telecommunications with demand uncertainty. Management Science 44 11 (1998) 5101-5110
57. Chamberland S., and Sanso B. Sequential and parallel approaches to incorporate reliability in the synthesis of computer networks. Journal of Network and Systems Management 5 2 (1997) 131-157
58. Zang H., Jue J., and Mukherjee B. A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks. Optical Networks Magazine 1 1 (2000) 47-60
59. Zang J., Zhu K., Sahasrabuddhe L., Yoo S., and Mukherjee B. On the study of routing and wavelength assignment approaches for survivable wavelength-routed WDM mesh networks. Optical Networks Magazine 4 6 (2003) 16-28
60. Kennington J., Olinick E., Ortynski A., and Spiride G. Wavelength routing and assignment in a survivable WDM mesh network. Operations Research 51 1 (2003) 67-79
61. Kennington J., and Olinick E. Wavelength translation in WDM networks: optimization models and solution procedures. INFORMS Journal on Computing 16 2 (2004) 174-187
62. Zymolka A, Koster A, Wessäly R. Transparent optical network design with sparse wavelength conversion. Technical report ZIB-report 02-34, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Takustrasse 7, D-14195 Berlin, Dahlem, Germany, 2002.
63. Chamberland S., Khyda D., and Pierre S. Joint routing and wavelength assignment in wavelength division multiplexing networks for permanent and reliable paths. Computers and Operations Research 32 5 (2005) 1073-1087
64. Balakrishnan A., Magnanti T., Sokol J., and Wang Y. Telecommunication link restoration planning with multiple facility types. Annals of Operations Research 106 (2001) 127-154
65. Bienstock D., and Günlük O. Capacitated network design-polyhedral structure and computation. INFORMS Journal on Computing 8 3 (1996) 243-259
66. Doucette J, Grover W, Martens R. Modularity and economy-of-scale effects in optical networks, In: IEEE Canadian conference electrical and computer engineering, vol. 1, 1999, p. 266-31.
67. Kennington J., and Lewis M. The path restoration version of the spare capacity allocation problem with modularity restrictions: models, algorithms, and an empirical analysis. INFORMS Journal on Computing 13 3 (2001) 181-190
68. Lewis M. Spare capacity planning for telecommunication networks: models and algorithms. PhD thesis, School of Engineering and Applied Science, Southern Methodist University, Dallas, TX, 2000.
69. Kröller A, Wessäly R. Integrated optimization of hardware configuration and capacity dimensioning in SDH and opaque WDM networks. In: Proceedings of the first international network optimization conference (INOC 2003), October 2003.
70. Melián B, Laguna M, Moreno-Pérez J. Minimizing the cost of placing and sizing wavelength division multiplexing and optical cross-connect equipment in a telecommunications network. Networks 2005;45(4):199-209.
71. Melián B., Laguna M., and Moreno-Pérez J. Capacity expansion of fiber optic networks with WDM systems: problem formulation and comparative analysis. Computers and Operations Research 31 3 (2004) 461-472
72. Dahl G., and Stoer M. A cutting plane algorithm for multicommodity survivable network design problems. INFORMS Journal on Computing 18 1 (1998) 1-11
73. Poppe F, Demeester P. Economic allocation of spare capacity in mesh-restorable networks: models and algorithms, In: Proceedings of the sixth international conference on telecommunications systems (ICTSM 1998), modeling and analysis, 1998, p. 77-86.
74. Orlowski S, Wessäly R. The effect of hop limits on optimal cost in survivable network design. Technical report ZIB-report 4-23, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Takustrasse 7, D-14195 Berlin-Dahlem, Germany, 2004.
75. Stidsen T, Thomadsen T. Joint optimization of working and p-cycle protection capacity. Technical report IMM-2004-8, DK-280 Kongens Lyngby, Denmark, Technical University of Denmark, 2004. Available online at 〈http://tomato.edm.trlabs.ca/p-cycles/techreports.htm〉.
76. Belotti P, Malucelli F. Shared protection network design: valid inequalities and a decomposition approach, Technical report, Operations Research Group DEI, Politecnico di Milano, P.za L. da Vinci 32, Milano, Italy, 2003. Available online at 〈http://www.elet.polimi.it/upload/belotti/papers/belotti_shared_protection.pdf〉.
77. Ben-Ameur W., and Gouveia L. Some recent contributions to network optimization. Networks 44 (2004) 27-30
78. Rajan D., and Atamtürk A. A directed cycle-based column-and-cut generation method for capacitated survivable network design. Networks 43 4 (2004) 201-211
79. Belotti P. Multicommodity network design with survivability constraints: some models and algorithms, PhD thesis, Politecnico di Milano Dipartimento di Elettronica ed Informazione, Milan, Italy, 2003. Available online at 〈http://www.elet.polimi.it/upload/belotti/papers/thesis.pdf〉.
80. Yuan D. Optimization models and methods for communication network design and routing. PhD thesis, Linköping University, Linköping, Sweden, 2001.