Abstract
Wavelength Division Multiplexing (WDM) optical networks are increasingly used to build up backbone networks. In this paper we study the Multicast Routing Wavelength Assignment with Delay Constraints (MRWA-DC) problem: given a WDM network with heterogeneous splitting capabilities, we want to find an optimal light-forest that respects delay bound constraints. We propose a new Integer Linear Programming compact formulation and we derive from it a new extended formulation. We solve the Linear Programming relaxation of the latter formulation using a column generation algorithm, and to address the resulting pricing problem we propose two exact algorithms and a tabu search heuristic. Experimental results show that in most cases the solutions obtained from the Linear Programming relaxation of the extended formulation are integral and that the combination of exact and heuristic algorithms for the pricing problem allows to reduce the total computation time required by the column generation process. With respect to the previous literature on the same problem we significantly reduce the computation time required for solving instances of comparable dimension and we solve, within a reasonable computation time, new instances of larger size.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bienstock, D., Goemans, M. X., Simchi-Levi, D., & Williamson, D. (1993). A note on the prize collecting traveling salesman problem. Mathematical Programming, 59(3), 413–420.
Chen, B., & Wang, J. (2002). Efficient routing and wavelength assignment for multicast in WDM networks. IEEE Journal on Selected Areas in Communications, 20(1), 97–109.
Chen, M. T., & Tseng, S. S. (2005). A genetic algorithm for multicast routing under delay constraint in WDM network with different light splitting. Journal of Information Science and Engineering, 21, 85–108.
Chen, M. T., Lin, B. M. T., & Tseng, S. S. (2008). Multicast routing and wavelength assignment with delay constraints in WDM networks with heterogeneous capabilities. Journal of Network and Computer Applications, 31(1), 47–65.
Cherkassky, B. V., & Goldberg, A. V. (1997). On implementing the push-relabel method for the maximum flow problem. Algorithmica, 19(4), 390–410.
Chlamtac, I., Ganz, A., & Karmi, G. (1992). Lightpath communications: an approach to high bandwidth optical WAN’s. IEEE Transactions on Communications, 40(7), 1171–1182.
Cordone, R., & Trubian, M. (2008). A relax-and-cut algorithm for the Knapsack node weighted Steiner tree problem. Asia-Pacific Journal of Operational Research, 25(3), 373–391.
Costa, A. M., Cordeau, J.-F., & Laporte, G. (2008). Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints. European Journal of Operational Research, 190(1), 68–78.
Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP-completeness. New York: W. H. Freeman. ISBN 0-7167-1044-7.
Glover, F. (1986). Future paths for integer programming and links to artificial intelligence. Computers & Operations Research, 13(5), 533–549.
Glover, F. W., & Laguna, M. (1997). Tabu search. Dordrecht: Kluwer Academic.
Jia, X., Du, D., & Hu, X. (2001). Integrated algorithms for delay bounded multicast routing and wavelength assignment in all optical networks. Computer Communications, 24(14), 1390–1399.
Joncour, C., Michel, S., Sadykov, R., Sverdlov, D., & Vanderbeck, F. (2010). Column generation based primal heuristics. Electronic Notes in Discrete Mathematics, 36(0), 695–702.
Lawler, E. (1976). Combinatorial optimizations: networks and matroids. New York: Holt, Rinehar and Winston.
Ljubić, I., Weiskircher, R., Pferschy, U., Klau, G. W., Mutzel, P., & Fischetti, M. (2006). An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem. Mathematical Programming, 105(2–3), 427–449.
Lübbecke, M. E., & Desrosiers, J. (2005). Selected topics in column generation. Operations Research, 53(6), 1007–1023.
Mukherjee, B. (2000). WDM optical communication networks: progress and challenges. IEEE Journal on Selected Areas in Communications, 18(10), 1810–1824.
Mukherjee, B. (2006). Optical WDM networks. Berlin: Springer.
Sahasrabuddhe, L. H., & Mukherjee, B. (1999). Light-trees: optical multicasting for improved performance in wavelength-routed networks. IEEE Communications Magazine, 37(2), 67–73.
Sreenath, N., Siva Ram Murthy, C., & Mohan, G. (2001). Virtual source based multicast routing in WDM optical networks. Photonic Network Communications, 3(3), 213–226.
Tzanakaki, A., Katrinis, K., Politi, T., Stavdas, A., Pickavet, M., Van Daele, P., Simeonidou, D., O’Mahony, M., Aleksic, S., Wosinska, L., & Monti, P. (2011). Dimensioning the future pan-European optical network with energy efficiency considerations. IEEE/OSA Journal of Optical Communications and Networking, 3(4), 272–280.
Waxman, B. M. (1988). Routing of multipoint connections. IEEE Journal on Selected Areas in Communications, 6(9), 1617–1622.
Wolsey, L. A. (1998). Integer programming. New York: Wiley-Interscience.
Yan, S., Ali, M., & Deogun, J. (2001). Route optimization of multicast sessions in sparse light-splitting optical networks. In IEEE GLOBECOM’01 (Vol. 4, pp. 22–29).
Zhang, X., Wei, J. Y., & Qiao, C. (2000). Constrained multicast routing in WDM networks with sparse light splitting. IEEE Journal of Lightwave Technology, 18(12), 1917–1927.
Zhu, Q., Parsa, M., & Garcia-Luna-Aceves, J. J. (1995). A source-based algorithm for delay-constrained minimum-cost multicasting. In Annual joint conference of the IEEE computer and communications societies (Vol. 1, pp. 377–385).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Colombo, F., Trubian, M. A column generation approach for Multicast Routing and Wavelength Assignment with Delay Constraints in heterogeneous WDM networks. Ann Oper Res 222, 239–260 (2014). https://doi.org/10.1007/s10479-013-1403-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-013-1403-7