Skip to main content
SpringerLink
Log in

Solving the Static Design Routing and Wavelength Assignment Problem

  • Conference paper
Book cover Recent Advances in Constraints (CSCLP 2009)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6384))

Abstract

In this paper we present a hybrid model for the static design variant of the routing and wavelength assignment problem in directed networks, an important benchmark problem in optical network design. Our solution uses a decomposition into a MIP model for the routing aspect, combined with a graph coloring step modelled using either MIP (Coin-OR), SAT (minisat) or finite domain constraints (ECLiPSe). We consider two possible objective functions, one minimizing the maximal number of frequencies used on any of the links, the other minimizing the total number of frequencies used. We compare the models on a set of benchmark tests, results show that the constraint model is much more scalable than the alternatives considered, and is the only one producing proven optimal or near optimal results when minimizing the total number of wavelengths.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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.

References

  1. Banerjee, D., Mukherjee, B.: A practical approach for routing and wavelength assignment in large wavelength-routed optical networks. IEEE Journal on Selected Areas in Communications 14(5), 903–908 (1996)

    Article  Google Scholar 

  2. Bessiere, C., Hebrard, E., Hnich, B., Kiziltan, Z., Walsh, T.: Filtering algorithms for the nvalue constraint. Constraints 11(4), 271–293 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  3. Eén, N., Sörensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502–518. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  4. Jaumard, B., Meyer, C., Thiongane, B.: ILP formulations for the routing and wavelength assignment problem: Symmetric systems. In: Resende, M., Pardalos, P. (eds.) Handbook of Optimization in Telecommunications, pp. 637–677. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  5. Jaumard, B., Meyer, C., Thiongane, B.: Comparison of ILP formulations for the RWA problem. Optical Switching and Networking 4(3-4), 157–172 (2007)

    Article  Google Scholar 

  6. Jaumard, B., Meyer, C., Thiongane, B.: On column generation formulations for the RWA problem. Discrete Applied Mathematics 157, 1291–1308 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  7. Lever, J.: A local search/constraint propagation hybrid for a network routing problem. International Journal on Artificial Intelligence Tools 14(1-2), 43–60 (2005)

    Article  Google Scholar 

  8. Liatsos, V., Novello, S., El Sakkout, H.: A probe backtrack search algorithm for network routing. In: Proceedings of the Third International Workshop on Cooperative Solvers in Constraint Programming, CoSolv 2003, Kinsale, Ireland (September 2003)

    Google Scholar 

  9. Lougee-Heimer, R.: The common optimization interface for operations research. IBM Journal of Research and Development 47, 57–66 (2003)

    Article  Google Scholar 

  10. Ramaswami, R., Sivarajan, K.N.: Routing and wavelength assignment in all-optical networks. IEEE/ACM Trans. Netw. 3(5), 489–500 (1995)

    Article  Google Scholar 

  11. Shen, K., Schimpf, J.: Eplex: Harnessing mathematical programming solvers for constraint logic programming. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 622–636. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  12. Simonis, H.: Constraint applications in networks. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming. Elsevier, Amsterdam (2006)

    Google Scholar 

  13. Simonis, H.: A hybrid constraint model for the routing and wavelength assignment problem. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 104–118. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  14. Smith, B.M.: Symmetry and search in a network design problem. In: Barták, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol. 3524, pp. 336–350. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  15. van Hoeve, W.J.: The alldifferent constraint: A survey. CoRR, cs.PL/0105015 (2001)

    Google Scholar 

  16. Wallace, M., Novello, S., Schimpf, J.: ECLiPSe: A platform for constraint logic programming. ICL Systems Journal 12(1) (May 1997)

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Cork Constraint Computation Centre, Department of Computer Science, University College Cork, Ireland

    Helmut Simonis

Authors
  1. Helmut Simonis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Software, Technical University of Catalonia, C. Jordi Girona 1-3, 08034, Barcelona, Spain

    Javier Larrosa

  2. Cork Constraint Computation Centre, University College Cork, Western Road, Corcaigh, Co., Cork, Ireland

    Barry O’Sullivan

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Simonis, H. (2011). Solving the Static Design Routing and Wavelength Assignment Problem. In: Larrosa, J., O’Sullivan, B. (eds) Recent Advances in Constraints. CSCLP 2009. Lecture Notes in Computer Science(), vol 6384. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19486-3_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-19486-3_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-19485-6

  • Online ISBN: 978-3-642-19486-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation