Skip to main content

ILP Formulations for the Routing and Wavelength Assignment Problem: Symmetric Systems

  • Chapter
Handbook of Optimization in Telecommunications

Abstract

Different integer linear programming (ILP) formulations have been proposed for the routing and wavelength assignment problem in WDM optical networks, mainly for asymmetrical systems, more than for symmetrical systems, under different objectives. We propose a synthesis of the mathematical models for symmetrical systems, with a unified and simplified notation for four widely used objectives. As for asymmetrical traffic models (Jaumard, Meyer, and Thiongane, 2004), we show that all formulations, both link and path formulations, are equivalent in terms of the upper bound value provided by the optimal solution of their linear programming relaxation, although their number of variables and constraints differ. We propose an experimental comparison of the best linear relaxation bounds with the optimal ILP solutions whenever it is possible, for several network and traffic instances.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  • R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network flows: theory, algorithms, and applications. Prentice Hall, 1993.

    Google Scholar 

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

    Article  Google Scholar 

  • C. Chen and S. Banerjee. A new model for optimal routing and wavelength assignment in wavelength division multiplexed optical networks. In INFOCOM’96, Proceedings IEEE, volume 1, pages 164–171, 1996.

    Google Scholar 

  • Cisco Systems. Comparing Metro WDM systems: Unidirectional vs. bidirectional implementations, 2001.

    Google Scholar 

  • D. Coudert and H. Rivano. Lightpath assignment for multifibers WDM networks with wavelength translators. In IEEE Globecom, pages 2686–2690, Taiwan, November 2002. OPNT-01-5.

    Google Scholar 

  • Cplex. Using the CplexCallable Library (Version 8.1). Cplex Optimization Inc., 2003.

    Google Scholar 

  • J. Doucette, M. Clouqueur, and W.D. Grover. On the availability and capacity requirements of shared backup path-protected mesh networks. Optical Networks Magazine, pages 29–44, November/December 2003.

    Google Scholar 

  • R. Dutta and G.N. Rouskas. A survey of virtual topology design algorithms for wavelength routed optical networks. Optical Networks Magazine, 1(1):73–89, January 2000.

    Google Scholar 

  • M.R. Garey and D.S. Johnson. Computers and Intractability, A Guide to the Theory of NP-completeness. W.H. Freeman, San Francisco, CA, 1979.

    MATH  Google Scholar 

  • W.D. Grover. Mesh-Based Survivable Networks. Prentice Hall, 2004.

    Google Scholar 

  • W.D. Grover. http://www.ee.ualberta.ca/~grover/, 2005.

  • B. Jaumard. Network and traffic data sets for optical network optimization. http://www.iro.umontreal.ca/~jaumard, 2005.

  • B. Jaumard, C. Meyer, and B. Thiongane. Comparison of ILP formulations for the RWA problem. Submitted for Publication, 2004a.

    Google Scholar 

  • B. Jaumard, C. Meyer, and B. Thiongane. On column generation formulations for the RWA problem. In INOC-International Network Optimization Conference, pages B1.52–B1.59, Lisbon, Portugal, March 20–23 2005.

    Google Scholar 

  • B. Jaumard, C. Meyer, B. Thiongane, and X. Yu. ILP formulations and optimal solutions for the RWA problem. In IEEE GLOBECOM, volume 3, pages 1918–1924, Nov.–Dec. 2004b.

    Google Scholar 

  • R.M. Krishnaswamy. Algorithms for Routing, Wavelength Assignment and Topology Design in Optical Networks. PhD thesis, Dept. of Electrical Commun. Eng., Indian Institute of Science, Bangalore, India, 1998.

    Google Scholar 

  • R.M. Krishnaswamy and K.N. Sivarajan. Algorithms for routing and wavelength assignment based on solutions of LP-relaxation. IEEE Communications Letters, 5(10):435–437, October 2001a.

    Article  Google Scholar 

  • R.M. Krishnaswamy and K.N. Sivarajan. Design of logical topologies: A linear formulation for wavelength routed optical networks with no wavelength changers. IEEE/ACM Transactions on Networking, 9(2): 184–198, April 2001b.

    Article  Google Scholar 

  • M.S. Kumar and P.S. Kumar. Static lightpath establishment in WDM networks-new ILP formulations and heuristic algorithms. Computer Communications, 25:109–114, 2002.

    Article  Google Scholar 

  • K. Lee, K.C. Kang, T. Lee, and S. Park. An optimization approach to routing and wavelength assignment in WDM all-optical mesh networks without wavelength conversion. ETRI Journal, 24(2): 131–141, April 2002.

    Google Scholar 

  • E. Leonardi, M. Mellia, and M.A. Marsan. Algorithms for the logical topology design in WDM all-optical networks. Optical Networks Magazine, 1:35–46, January 2000.

    Google Scholar 

  • L. Margara and J. Simon. Wavelength assignment problem on all-optical networks with k fibres per link. In Automata, Languages and Programming. 27th International Colloquium, ICALP 2000, volume 1853 of Lectures Notes in Computer Science, pages 768–779, 2000.

    Article  MathSciNet  Google Scholar 

  • B. Mukherjee. WDM-based local lightwave networks. I. single-hop systems. Networks, 6(3): 12–27, May 1992a.

    Article  Google Scholar 

  • B. Mukherjee. WDM-based local lightwave networks. II. multi-hop systems. Networks, 6(4):20–32, July 1992b.

    Article  Google Scholar 

  • T.F. Noronha and C.C. Ribeiro. Routing and wavelength assignment by partition coloring. European Journal of Operational Research, 2005. to appear.

    Google Scholar 

  • M.J. O’Mahony, D. Simeonidu, A. Yu, and J. Zhou. The design of the european optical network. Journal of Ligthwave Technology, 13(5):817–828, 1995.

    Article  Google Scholar 

  • R. Ramaswami and K.N. Sivarajan. Routing and wavelength assignment in all-optical networks. IEEE/ACM Transactions on Networking, 5(3):489–501, October 1995.

    Article  Google Scholar 

  • R. Ramaswami and K.N. Sivarajan. Optical Networks-A Practical Perspective. Morgan Kaufmann, 2nd edition edition, 2002.

    Google Scholar 

  • N. Wauters and P. Demeester. Design of the optical path layer in multiwavelength cross-connected networks. IEEE Journal on Selected Areas in Communications, 14(5):881–892, June 1996.

    Article  Google Scholar 

  • H. Zang, J. P. Jue, and B. Mukherjee. A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks. Optical Networks Magazine, pages 47–60, January 2000.

    Google Scholar 

  • J. Zheng and H. Mouftah. Optical WDM Networks. Wiley Interscience, 2004.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer Science+Business Media, Inc.

About this chapter

Cite this chapter

Jaumard, B., Meyer, C., Thiongane, B. (2006). ILP Formulations for the Routing and Wavelength Assignment Problem: Symmetric Systems. In: Resende, M.G.C., Pardalos, P.M. (eds) Handbook of Optimization in Telecommunications. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30165-5_23

Download citation

Publish with us

Policies and ethics