Solving the physical impairment aware routing and wavelength assignment problem in optical WDM networks using a tabu search based hyper-heuristic approach

Authors:
Ali Keleş;A. Şima Uyar;Ayşegül Yayımlı
Affiliations:
Computer Engineering Department, Istanbul Techincal University, Istanbul, Turkey;Computer Engineering Department, Istanbul Techincal University, Istanbul, Turkey;Computer Engineering Department, Istanbul Techincal University, Istanbul, Turkey
Venue:
EvoCOMNET'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part II
Year:
2010

Citing 5
Cited 0

Optical WDM Networks (Optical Networks)

Optical WDM Networks (Optical Networks)
A survey on physical layer impairments aware routing and wavelength assignment algorithms in optical networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Design methodology for WDM backbone networks using FWM-aware heuristic algorithm

Optical Switching and Networking
Performance engineering of metropolitan area optical networks through impairment constraint routing

IEEE Communications Magazine
Cross-layer adaptive routing and wavelength assignment in all-optical networks

IEEE Journal on Selected Areas in Communications - Part Supplement

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a tabu search based hyper heuristic is applied to the routing and wavelength assignment problem, considering physical impairments caused by Amplified Spontaneous Emission noise in erbium-doped fiber amplifiers and crosstalk noise at optical cross-connects. The objective is to minimize the total bit error rate of the routed lightpaths over optical wavelength division multiplexing networks. The results of the tabu search based hyper-heuristics are compared with single heuristic approaches. The results show that different heuristics provide the best result for different instances. The tabu search based hyper heuristic, which combines all the heuristics, gives comparable results to the single heuristics while using a modest amount of time. Furthermore, it has the best results for some problem instances.