Abstract
Link dimensioning and routing problems in resilient network design are considered. Reliable network operation is ensured by means of flow restoration which is performed on preselected protection (backup) paths that can absorb traffic overflows from failed primary paths. Backup and primary flows use separated link capacities, and can be split among many paths. In the paper, two restoration models are considered. The first model assumes that once the backup path is assigned it must be used in every state in which the protected primary path fails while the second model allows different protection paths to be used in different network failure states. The problems are formulated as multiple commodity linear programming (LP) models using the link-path (L-P) notation and solved by the column generation technique. Consequent pricing models and algorithms are introduced. Computational efficiency of the presented approaches is analyzed.
The research was partially supported by the Dean’s grant from the Faculty of Electronics and Information Technology, Warsaw University of Technology.
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
Pióro, M., Medhi, D.: Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kaufman, San Francisco (2004)
Minoux, M., Serrault, J.Y.: Subgradient optimization and large scale programming: an application to optimum multicommodity network synthesis with security constraints. R.A.I.R.O. Operations Research 15(2) (1981)
Dahl, G., Stoer, M.: A cutting plane algorithm for multicommodity survivable network design problems. INFORMS Journal on Computing 10, 1–11 (1998)
Wessäly, R.: Dimensioning Survivable Capacitated NETworks. PhD thesis, Technische Universität Berlin (2000)
Hu, J.: Diverse routing in optical mesh networks. IEEE Trans. Com. 51(3), 489–494 (2003)
Maurras, J.F., Vanier, S.: Network synthesis under survivability constraints. 4OR (2), 52–67 (2004)
Coudert, D., Datta, P., Perennes, S., Rivano, H., Voge, M.E.: Complexity and approximability issues of shared risk resource group. Technical report, Technical report 5859, INRIA (2006)
Stidsen, T., Petersen, B., Rasmussen, K., Spoorendonk, S., Zachariasen, M., Rambach, F., Kiese, M.: Optimal routing with single backup path protection. In: International Network Optimization Conference INOC 2007, Spa, Belgium (2007)
Bashllari, A., Nace, D., Rourdin, E., Klopfenstein, O.: The MMF rerouting computation problem. In: International Network Optimization Conference INOC 2007, Spa, Belgium (2007)
Orlowski, S., Pióro, M.: On the complexity of column geneartion in survivable network design. Technical report, Zuse Institut Berlin and Warsaw University of Technology (2007)
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)
Irnich, S., Desaulniers, G.: Shortest path problems with resource constraints. In: Desaulniers, G., Desrosier, J., Solomon, M. (eds.) Column Generation, pp. 33–65. Springer, Heidelberg (2005)
Koster, A., Zymolka, A., Jäger, M., Hülsermann, R.: Demand-wise shared protection for meshed optical networks. Journal of Network and Systems Management 13(1), 35–55 (2005)
Wessäly, R., Orlowski, S., Zymolka, A., Koster, A., Gruber, C.: Demand-wise shared protection revisited: A new model for survivable network design. In: Proc. INOC 2005, Lisbon, pp. 100–105 (2005)
Dantzig, G.B., Wolfe, P.: The decomposition algorithm for linear programming. Operations Research 8, 101–111 (1960)
Desrosiers, J., Luebbecke, M.: A primer in column generation. In: Desaulniers, G., Desrosier, J., Solomon, M. (eds.) column generation, pp. 1–32. Springer, Heidelberg (2005)
Orlowski, S.: Local and global restoration of node and link failures in telecommunication networks. M.sc. thesis, Technische Universität Berlin (2003), http://www.zib.de/orlowski/
Strand, J., Chiu, A.L., Tkach, R.: Issues for routing in the optical layer. IEEE Communications Magazine, 81–87 (2001)
Yen, J.Y.: Finding the k shortest loopless paths in a network. Management Science 17, 712–716 (1971)
McCallum, C.J.: An algorithm for finding the k shortest paths in a network. Bell Laboratories Technical Memorandum TM73-1713-9 (1973)
Eppstein, D.: Finding the k shortest paths. In: 35th IEEE Symposium on Foundations of Computer Science, pp. 154–165 (1994)
Dreyfus, S.E.: An appraisal of some shortest-path algorithms. Operations Research 17, 395–412 (1999)
Jiménez, V.M., Marzal, A.: Computing the k shortest paths: A new algorithm and an experimental comparison. In: Proceedings of 3rd Annual Workshop on Algorithmic Engineering, London (1999)
Pascoal, M.M.B., Eugénia, M., Captivo, V., Climaco, J.C.N.: An algorithm for ranking quickest simple paths. Computers and Operations Research 32, 509–520 (2005)
Orlowski, S., Pióro, M., Tomaszewski, A., Wessäly, R.: SNDlib 1.0–Survivable Network Design Library. In: Proceedings of the 3rd International Network Optimization Conference (INOC 2007), Spa, Belgium (2007), http://sndlib.zib.de
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pióro, M., Śliwiński, T., Zagożdżon, M., Dzida, M., Ogryczak, W. (2008). Path Generation Issues for Survivable Network Design. In: Gervasi, O., Murgante, B., Laganà, A., Taniar, D., Mun, Y., Gavrilova, M.L. (eds) Computational Science and Its Applications – ICCSA 2008. ICCSA 2008. Lecture Notes in Computer Science, vol 5073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69848-7_65
Download citation
DOI: https://doi.org/10.1007/978-3-540-69848-7_65
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69840-1
Online ISBN: 978-3-540-69848-7
eBook Packages: Computer ScienceComputer Science (R0)