Skip to main content

A Simulated Annealing Heuristic for a Branch and Price-Based Routing and Spectrum Allocation Algorithm in Elastic Optical Networks

  • Conference paper
  • First Online:
Book cover Intelligent Data Engineering and Automated Learning – IDEAL 2015 (IDEAL 2015)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9375))

Abstract

In the paper we focus on developing an efficient algorithm capable of producing optimal solutions to the problem of routing and spectrum allocation (RSA) – a basic optimization problem in elastic optical networks. We formulate the problem as a mixed-integer program and we solve it using a branch and price (BP) algorithm. With the aim to improve the performance of BP, we enhance it with a simulated annealing-based RSA heuristic that is employed in the search for upper bound solutions. The results of numerial experiments show that the heuristic allows to decrease significantly the time required to solve the problem.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and 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

References

  1. Gerstel, O., et al.: Elastic optical networking: a new dawn for the optical layer? IEEE Commun. Mag. 50(2), 12–20 (2012)

    Article  Google Scholar 

  2. Klinkowski, M., Walkowiak, K.: On the advantages of elastic optical networks for provisioning of cloud computing traffic. IEEE Network 27(6), 44–51 (2013)

    Article  Google Scholar 

  3. Klinkowski, M., Walkowiak, K.: Routing and spectrum assignment in spectrum sliced elastic optical path network. IEEE Commun. Lett. 15(8), 884–886 (2011)

    Article  Google Scholar 

  4. Christodoulopoulos, K., et al.: Elastic bandwidth allocation in flexible OFDM based optical networks. IEEE J. Lightwave Technol. 29(9), 1354–1366 (2011)

    Article  Google Scholar 

  5. Żotkiewicz, M., et al.: Optimization models for flexgrid elastic optical networks. In: Proceedings of IEEE ICTON, Cartagena, Spain (2013)

    Google Scholar 

  6. Velasco, L., et al.: Solving routing and spectrum allocation related optimization problems: from off-line to in-operation flexgrid network planning. IEEE J. Lightwave Technol. 32(16), 2780–2795 (2014)

    Article  Google Scholar 

  7. Klinkowski, M.: An evolutionary algorithm approach for dedicated path protection problem in elastic optical networks. Cybern. Syst. 44(6–7), 589–605 (2013)

    Article  Google Scholar 

  8. Aibin, M., Walkowiak, K.: Simulated annealing algorithm for optimization of elastic optical networks with unicast and anycast traffic. In: Proceedings of IEEE ICTON, Graz, Austria (2014)

    Google Scholar 

  9. Goścień, R., et al.: Tabu search algorithm for routing, modulation and spectrum allocation in elastic optical network with anycast and unicast traffic. Comput. Network 79, 148–165 (2015)

    Article  Google Scholar 

  10. Walkowiak, K., et al.: Routing and spectrum allocation algorithms for elastic optical networks with dedicated path protection. Opt. Switch Network. 13, 63–75 (2014)

    Article  Google Scholar 

  11. IBM: ILOG CPLEX optimizer (2012). http://www.ibm.com

  12. Klinkowski, M., et al.: Spectrum allocation problem in elastic optical networks - a branch-and-price approach. In: Proceedings of IEEE ICTON, Budapest, Hungary (2015)

    Google Scholar 

  13. Barnhart, C., et al.: Branch-and-price: column generation for solving huge integer programs. Oper. Res. 46(3), 316–329 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  14. Velasco, L., et al.: Modeling the routing and spectrum allocation problem for flexgrid optical networks. Photonic Network Commun. 24(3), 177–186 (2012)

    Article  Google Scholar 

  15. Ruiz, M., et al.: Column generation algorithm for RSA problems in flexgrid optical networks. Photonic Network Commun. 26(2–3), 53–64 (2013)

    Article  Google Scholar 

  16. Talbi, E.G.: Metaheuristics: from Design to Implementation. Wiley, New York (2009)

    Book  MATH  Google Scholar 

Download references

Acknowledgment

This work was supported by the Polish National Science Centre (NCN) under Grant DEC-2012/07/B/ST7/01215 and by the FP7 project IDEALIST (grant no. 317999)

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mirosław Klinkowski .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Klinkowski, M., Walkowiak, K. (2015). A Simulated Annealing Heuristic for a Branch and Price-Based Routing and Spectrum Allocation Algorithm in Elastic Optical Networks. In: Jackowski, K., Burduk, R., Walkowiak, K., Wozniak, M., Yin, H. (eds) Intelligent Data Engineering and Automated Learning – IDEAL 2015. IDEAL 2015. Lecture Notes in Computer Science(), vol 9375. Springer, Cham. https://doi.org/10.1007/978-3-319-24834-9_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-24834-9_35

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-24833-2

  • Online ISBN: 978-3-319-24834-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics