Skip to main content

Advertisement

Log in

Evaluation performance of genetic algorithm and tabu search algorithm for solving the Max-RWA problem in all-optical networks

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

In this paper, we deal with the static Routing and Wavelength Assignment (RWA) problem in networks with no wavelength converters, and where a given static set of connection demands is prearranged. Our objective is to maximize the number of optical connection-requests that can be established for a given number of wavelengths. A mathematical formulation for Max-RWA was presented. In this article, we implement and compare the performance of two random search algorithms namely: the genetic algorithm and the tabu search algorithm. Using these metaheuristics we solved approximately the wavelength assignment problem for Max-RWA while we computed its routing by a deterministic method which is the backtracking. Therefore we conducted many extensive experiments under different circumstances. Diagrams and representative numerical examples indicate the accuracy of our algorithms.

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.

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  • Banerjee N, Mehta V, Pandey S (2003) A genetic algorithm approach for solving the routing and wavelength assignment problem in WDM networks. http://people.cs.umass.edu/~nilanb/papers/ICN.pdf. Accessed 17 Oct 2012

  • Camera M, Olsson B, Bruno G (2010) Beyond 100Gbit/s: system implications towards 400G and 1T. In: Optical communication (ECOC), pp 1–15.

  • Chlamtac I, Ganz A, Karmi G (1992) Lightpath communications: an approach to high-bandwidth optical WAN’s. IEEE Trans Commun 40:1171–1182

    Google Scholar 

  • Dzongang C, Galinier P, Pierre S (2005) A Tabu search heuristic for the routing and wavelength assignment problem in optical networks. IEEE Commun Lett 9(5):426–428

    Google Scholar 

  • Glover F, Laguna M (1997) Tabu search. Kluwer Academic, Boston, MA

    Book  MATH  Google Scholar 

  • Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison Wesley, Reading, MA

  • Kharroubi F, Chen L, Yu J, (2012) Approaches and controllers to solving the contention problem for packet switching networks: a survey. In: Internet of things (IOT)—proceedings of international workshop. Communications in computer and information science (CCIS), vol 312, pp 172–182.

  • Krishnaswamy RM, Sivarajan KN (2001) Algorithms for routing and wavelength assignment based on solutions of LP-relaxations. IEEE Commun Lett 5(10):435–437

    Google Scholar 

  • Melanie M (1996) An introduction to genetic algorithms. MIT Press, Cambridge, MA. ISBN 9780585030944

  • Noronha TF, Resende MGC, Ribeiro CC (2011) A biased random-key genetic algorithm for routing and wavelength assignment. J Glob Optim 50(3):503–518

    Google Scholar 

  • Oliveira C, Pardalos PM (2011) Mathematical aspects of network routing optimization. Springer, Berlin

  • Ozdagla AE, Bertsekas DP (2003) Routing and wavelength assignment in optical networks. IEEE/ACM Trans Netw 11(2):248–258

    Google Scholar 

  • Pardalos PM, Resende MGC (2002) Handbook of applied optimization. Oxford University Press, Oxford

  • Pardalos PM, Resende MGC (2006) Handbook of optimization in telecommunications. Springer, Berlin

  • Qin H, Liu Z, Zhang S, Wen A (2002) Routing and wavelength assignment based on genetic algorithm. IEEE Commun Lett 6(10):455–457

    Google Scholar 

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

    Google Scholar 

  • Skorin-Kapov N (2006) Heuristic algorithms for the routing and wavelength assignment of scheduled lightpath demands in optical networks. IEEE J Sel Areas Commun 24(8):2–15

    Google Scholar 

  • Skorin-Kapov N, Chen J, Wosinska L (2009) A new approach to optical networks security: attack-aware routing and wavelength assignment. Networking IEEE/ACM Trans 18(3):750–760

    Google Scholar 

  • Wang Y, Cheng TH, Lim MH (2005) A tabu search algorithm for static routing and wavelength assignment problem. IEEE Commun Lett 9(9):841–843

    Google Scholar 

  • Xue F, Yoo SJB (2004) High-capacity multiservice optical label switching for the next—generation internet. IEEE Commun Mag 42(5):16–22

    Google Scholar 

  • Yu Z, Dong HC, Chien YS, Chi N (2012) 7-Tb/s (7 \(\times \) 1.284 Tb/s/ch) Signal transmission over 320 km using PDM-64QAM modulation. IEEE Photonics Technol Lett 24(4):264

    Google Scholar 

  • Zabinsky ZB (2009) Random search algorithms. http://sisley.en.kku.ac.th/project/2010/COE201027/Reference/RandomSearch4.05.2009.pdf. Accessed 03 Sept 2012

  • Zhan H, Jue JP, Mukherjee B (2000) A review of routing and wavelength assignment approaches for wavelength—routed optical WDM networks. Optical Netw Mag. http://sprintlabs.com/~hzang/publications/RWA.pdf. Accessed 20 Aug 2012

Download references

Acknowledgments

The first author would like to thank Mohammed Sahli and Abdenbi Mazoul for their helpful discussions during the coding phase. This work is supported by the National “863” High Tech Research and Development Program of China (2011AA010203), by the National Natural Science Foundation of China (61307087, 61377079), by the Hunan Provincial Natural Science Foundation of China (12JJ3070) and by the Open Fund of State Key Laboratory of Information Photonics and Optical Communications (Beijing University of Posts and Telecommunications).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lin Chen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kharroubi, F., He, J., Tang, J. et al. Evaluation performance of genetic algorithm and tabu search algorithm for solving the Max-RWA problem in all-optical networks. J Comb Optim 30, 1042–1061 (2015). https://doi.org/10.1007/s10878-013-9676-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-013-9676-y

Keywords

Navigation