Survivable network design: Routing of flows and slacks

Operations Research/ Computer Science Interfaces Series

Volumn 23, Issue , 2003, Pages 65-81

  Rajan, Deepak ^a   Atamtürk, Alper ^a  

^a DEPARTMENT OF INDUSTRIAL ENGINEERING AND OPERATIONS RESEARCH   (United States)

Author keywords

Column generation; P cycles; Pricing complexity; Survivable network design

Indexed keywords

EID: 84888776377     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-1-4757-3762-2     Document Type: Article

References (21)

1. Ahuja, R. K., Magnanti, T. L., and Orlin, J. B. (1993). Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs, NJ.
2. Altinkemer, K. (1994). Topological design of ring networks. Computers and Operations Research, 21:421-431.
3. Alevras, D., Grôtschel, M., and Wessàly R. (1998). Cost-efficient network synthesis from leased lines. Annals of Operations Research, 76:1-20.
4. Balakrishnan, A., Magnanti, T. L., Sokol, J. S., and Wang, Y. Modeling and solving the single facility line restoration problem. Operations Research, to appear.
5. 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.
6. Bienstock, D. and Muratore, G. (2000). Strong inequalities for capacitated survivable network design problems. Mathematical Programming, 89:127-147.
7. 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.
8. Chvâtal, V. (1983). Linear Programming. W. H. Freeman and Company, New York.
9. Dahl, G. and Stoer, M. (1998). A cutting plane algorithm for multicommodity survivable network design problems. INFORMS Journal on Computing, 10:1-11.
10. 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.
11. Goldschmidt, O., Laugier, A., and Olinick, E. V SONET/SDH ring assignment with capacity constraints. Discrete Applied Mathematics, to appear.
12. 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.
13. 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.
14. Iraschko, R., MacGregor, M., and Grover, W. (1998). Optimal capacity placement for path restoration in STM or ATM mesh survivable networks. 1EEE/ACM Transactions on Networking 6:325-336.
15. 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.
16. 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.
17. 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.
18. Schupke, D. A., Gruber, C. G., and Autenneth, A. (2002). Optimal configuration of p-cycles in WDM networks. IEEE International Conference on Communications 2002.
19. 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.
20. 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.
21. 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.