Abstract
We present a new mixed—integer programming model and a column generation method for the survivable design of telecommunication networks. In contrast to other failure scenario models, the new model has almost the same number of constraints as the regular network design problem, which makes it effective for large instances. Even though the complexity of pricing the exponentially many variables of the model is NP—hard, in our computational experiments, we are able to produce capacity—efficient survivable networks with dense graphs up to 70 nodes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahuja, R. K., Magnanti, T. L., and Orlin, J. B. (1993). Network Flows: Theory, Algorithms, and Applications. Prentice—Hall, Englewood Cliffs, NJ.
Altinkemer, K. (1994). Topological design of ring networks. Computers and Operations Research, 21:421–431.
Alevras, D., Grötschel, M., and Wessäly R. (1998). Cost—efficient network synthesis from leased lines. Annals of Operations Research, 76:1–20.
Balakrishnan, A., Magnanti, T. L., Sokol, J. S., and Wang, Y. Modeling and solving the single facility line restoration problem. Operations Research, to appear.
Balakrishnan, A., Magnanti, T. L., Sokol, J. S., and Wang, Y. (2001). Telecommunication link restoration planning with multiple facility types. Annals of Operations Research, 106:127–154.
Bienstock, D. and Muratore, G. (2000). Strong inequalities for capacitated survivable network design problems. Mathematical Programming, 89:127–147.
Chung, S. H, King, H. G., Yoon Y. S., and Tcha, D. W. (1996). Cost—minimizing construction of a unidirectional SHR with diverse protection. IEEE Transactions on Networking, 4:921–928.
Chvátal, V. (1983). Linear Programming. W. H. Freeman and Company, New York.
Dahl, G. and Stoer, M. (1998). A cutting plane algorithm for multicommodity survivable network design problems. INFORMS Journal on Computing, 10:1–11.
Garey, M. R. and Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP—Completeness. W. H. Freeman and Company, New York.
Goldschmidt, O., Laugier, A., and Olinick, E. V SONET/SDH ring assignment with capacity constraints. Discrete Applied Mathematics, to appear.
Grover, W. D. and Stamatelakis, D. (1998). Cycle—oriented distributed pre—configuration: ring—like speed with mesh—like capacity for self—planning network restoration. Proceedings of IEEE International Conference on Communications 1998, 537–543.
Herzberg, M., Bye, S. J., and Utano, A. (1995). The hop—limit approach for spare capacity assignment in survivable networks. IEEE/ACM Transactions on Networking 3:775–784.
Iraschko, R., MacGregor, M., and Grover, W. (1998). Optimal capacity placement for path restoration in STM or ATM mesh survivable networks. IEEE/ACM Transactions on Networking 6:325–336.
Jones, K. L., Lustig, I. J., Farvolden, J. M., and Powell, W. B. (1993). Multicommodity network flows: the impact of formulation on decomposition. Mathematical Programming 62:95–117.
Lisser, A., Sarkissian, R., and Vial, J. P. (1995). Survivability in telecommunication networks. Technical Report 1995.3, Department of Management Studies, University of Geneva, Switzerland.
Luss, H., Rosenwein, M. B., and Wong, R. T. (1998). Topological network design for SONET ring architecture. IEEE Transactions on Systems, Man and Cybernetics, 28:780–790.
Schupke, D. A., Gruber, C. G., and Autenrieth, A. (2002). Optimal configuration of p—cycles in WDM networks. IEEE International Conference on Communications 2002.
Soriano, P., Wynants, C, Séguin, R., Labbé, M., Gendreau, M., and Fortz, B. (1998). Design and dimensioning of survivable SDH/SONET networks. In Sansò, B. and Soriano, P., editors, Telecommunications Network Planning, pages 147–168. Kluwer Academic Publishers, Netherlands.
Stamatelakis, D. and Grover, W. D. (2000). Theoretical underpinnings for the efficiency of restorable networks using pre—configured cycles (“p—cycles”). IEEE Transactions on Communications, 48:1262–1265.
Xiong, Y. and Mason, L. G. (1999). Restoration strategies and spare capacity requirements in self—healing ATM networks. IEEE/ACM Transactions on Networking, 7:98–110.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Rajan, D., Atamtürk, A. (2003). Survivable Network Design: Routing of Flows and Slacks. In: Anandalingam, G., Raghavan, S. (eds) Telecommunications Network Design and Management. Operations Research/Computer Science Interfaces Series, vol 23. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3762-2_4
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3762-2_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5326-1
Online ISBN: 978-1-4757-3762-2
eBook Packages: Springer Book Archive