Skip to main content
Log in

Designing WDM Optical Networks Using Branch-and-Price

  • Published:
Journal of Mathematical Modelling and Algorithms in Operations Research

Abstract

In this paper, we present an exact solution procedure for the design of two-layer wavelength division multiplexing (WDM) optical networks with wavelength changers and bifurcated flows. This design problem closely resembles the traditional multicommodity flow problem, except that in the case of WDM optical networks, we are concerned with the routing of multiple commodities in two network layers. Consequently, the corresponding optimization models have to deal with two types of multicommodity variables defined for each of the network layers. The proposed procedure represents one of the first branch-and-price algorithms for a general WDM optical network setting with no assumptions on the number of logical links that can be established between nodes in the network. We apply our procedure in a computational study with four different network configurations. Our results show that for the three tested network configurations our branch-and-price algorithm provides solutions that are on average less than 5 % from optimality. We also provide a comparison of our branch-and-price algorithm with two simple variants of the upper bounding heuristic procedure HLDA that is commonly used for WDM optical network design.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Azodolmolky, S., Klinkowski, M., Marin, E., Careglio, D., Pareta, J., Tomkos, I.: A survey of physical layer impairments aware routing and wavelength assignment algorithms in optical networks. Comput. Netw. 53, 926–944 (2009)

    Article  MATH  Google Scholar 

  2. Ball, M.O., Vakhutinsky, A.: Fault tolerant virtual path layout: optimization models. In: Sanso, B., Soriano, P. (eds.) Telecommunications Network Planning, pp. 210–217. Kluwer Academic, Boston (1998)

    Google Scholar 

  3. Ball, M.O., Vakhutinsky, A.: Fault-tolerant virtual path layout in ATM networks. INFORMS J. Comput. 13(1), 76–94 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bandyopadhyay, S.: Dissemination of Information in Optical Networks: from Technology to Algorithms. Springer (2008)

  5. Banerjee, D., Mukherjee, B.: Wavelength-routed optical networks: linear formulation, resource budgeting tradeoffs, and a reconfiguration study. IEEE/ACM Trans. Netw. 8(5), 598–607 (2000)

    Article  Google Scholar 

  6. Barnhart, C., Hane, C.A., Vance, P.H.: Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Oper. Res. 48(2), 318–326 (2000)

    Article  Google Scholar 

  7. Belotti, P., Malucelli, F.: Multilayer network design: a row-column generation algorithm. In: Proceedings of International Network Optimization Conference, pp. B2.422–B2.427 (2005)

  8. Cinkler, T., Coudert, D., Flammini, M., Monaco, G., Moscardelli, L., Munoz, X., Sau, I., Shalom, M., Zaks, S.: Traffic grooming: combinatorial results and practical resolutions. In: Koster, A., Munoz, X. (eds.) Graphs and Algorithms in Communication Networks, pp. 63–94. Springer (2010)

  9. Dahl, G., Martin, A., Stoer, M.: Routing through virtual paths in layered telecommunication networks. Oper. Res. 47(5), 693–702 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  10. Desaulniers, G., Desrosiers, J., Solomon, M.M. (eds.): Column Generation. Springer (2005)

  11. Durhuus, T., Mikkelsen, B., Joergensen, C., Danielsen, S., Stubkjaer, K.: All-optical wavelength conversion by semiconductor optical amplifiers. J. Lightwave Technol. 14(6), 942–954 (1996)

    Article  Google Scholar 

  12. Elmirghani, J., Mouftah, H.: All-optical wavelength conversion technologies and applications in DWDM networks. IEEE Commun. Mag. 38(3), 86–92 (2000)

    Article  Google Scholar 

  13. Garg, N., Vazirani, V.V., Yannakakis, M.: Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18, 3–20 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  14. Haque, A., Aneja, Y.P., Bandyopadhyay, S., Jaekel, A., Sengupta, A.: Some studies on the logical topology design of large multi-hop optical networks. Opt. Netw. Mag. 3(4), 96–105 (2002)

    Google Scholar 

  15. Hu, J.Q., Leida, B.: Traffic grooming, routing, and wavelength assignment in optical WDM mesh networks. In: Proceedings of the 23rd Annual Joint Conference IEEE Computer Communications Society, vol. 1, pp. 495–501. IEEE, Piscataway (2004)

    Google Scholar 

  16. ILOG Branch & Price & Cut Shortest Path Optimizers Prototype Manual. ILOG, France (2003)

  17. Konda, V.R., Chow, T.Y.: Algorithm for traffic grooming in optical networks to minimize the number of transceivers. In: Proc. IEEE 2001 Workshop on High Performance Switching and Routing, pp. 218–221 (2001)

  18. Mukherjee, B.: Optical WDM Networks. Springer (2006)

  19. Mukherjee, B., Banerjee, D., Ramamurthy, S., Mukherjee, A.: Some principles for designing a wide-area WDM optical network. IEEE/ACM Trans. Netw. 4(5), 684–696 (1996)

    Article  Google Scholar 

  20. Prathombutr, P., Stach, J., Park, E.K.: An algorithm for traffic grooming in WDM optical mesh networks with multiple objectives. Telecommun. Syst. 28(3–4), 369–386 (2005)

    Article  Google Scholar 

  21. Raghavan, S., Stanojević, D.: Branch-and-price for WDM optical networks with no bifurcation of flow. INFORMS J. Comput. 23(1), 56–74 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  22. Ramaswami, R., Sivarajan, K.N.: Design of logical topologies for wavelength-routed optical networks. IEEE J. Sel. Areas Telecommun. 14(5), 840–851 (1996)

    Article  Google Scholar 

  23. Ramaswami, R., Sivarajan, K., Sasaki, G.: Optical Networks: A Practical Perspective, 3rd edn. Morgan Kaufmann, San Francisco (2009)

    Google Scholar 

  24. Runge, P., Bunge, C.-A., Petermann, K.: All-optical wavelength conversion with extinction ratio improvement of 100 gb/s rz-signals in ultralong bulk semiconductor optical amplifiers. IEEE J. Quantum Electron. 46(6), 937–944 (2010)

    Article  Google Scholar 

  25. Somani, A.: Survivability and Traffic Grooming in WDM Optical Networks. Cambridge University Press, Cambridge (2006)

    Book  Google Scholar 

  26. Subramaniam, S., Azizoglu, M., Somani, A.: All-optical networks with sparse wavelength conversion. IEEE/ACM Trans. Netw. 4(4), 544–557 (1996)

    Article  Google Scholar 

  27. Sung, C.S., Song, S.H.: Branch-and-price algorithm for a combined problem of virtual path establishment and traffic packet routing in a layered communication network. J. Oper. Res. Soc. 54(1), 72–82 (2003)

    Article  MATH  Google Scholar 

  28. Talebi, N., Shahabadi, M.: All-optical wavelength converter based on a heterogeneously integrated GaP on a silicon-on-insulator waveguide. J. Opt. Soc. Am. B 27(11), 2273–2278 (2010)

    Article  MATH  Google Scholar 

  29. Vanderbeck, F.: Implementing mixed integer column generation. In: Desaulniers, G., Desrosiers, J., Solomon, M.M. (eds.) Column Generation. Kluwer (2005)

  30. Vanderbeck, F., Wolsey, L.A.: An exact algorithm for IP column generation. Oper. Res. Lett. 19, 151–159 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  31. Zhu, K., Mukherjee, B.: Traffic grooming in an optical WDM mesh network. IEEE J. Sel. Areas Commun. 20(1), 122–133 (2002)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to S. Raghavan.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Raghavan, S., Stanojević, D. Designing WDM Optical Networks Using Branch-and-Price. J Math Model Algor 12, 407–428 (2013). https://doi.org/10.1007/s10852-013-9221-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10852-013-9221-0

Keywords

Navigation