Authors: Tintor, Vladica
Urošević, Dragan 
Anđelić, B.
Radunović, Jovan
Mladenović, Nenad 
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: Variable neighbourhood search for resolving routing and wavelength assignment problem in optical wavelength-division multiplexing networks
Journal: IET Communications
Volume: 5
Issue: 14
First page: 2028
Last page: 2034
Issue Date: 23-Sep-2011
Rank: M22
ISSN: 1751-8628
DOI: 10.1049/iet-com.2010.1126
The issue of finding optimal signal routes is one of the main challenges within the framework of optimal networks. This study aims at illustrating the development of a new, mixed-integer mathematical model for solving the static routing and wavelength assignment (RWA) problem in optical wavelength-division multiplexing (WDM) networks and presents the comparison of results obtained by heuristics and CPLEX commercial software. The objective function of the mathematical model is to minimise the blocking probability by maximising the number of successfully connected lightpaths. In this paper two WDM networks with full wavelength conversion nodes were tested. The proposed heuristics are the variable neighbourhood search (VNS) and tabu search (TS). Firstly, the authors compare the results obtained by these two heuristics and CPLEX on a low-complexity WDM network, aiming to determine whether these heuristics may yield results which approximate optimal results. Secondly, having illustrated that the heuristics provide satisfactory results, the authors run these heuristics on a high-complexity WDM network. The results indicate minor differences in blocking probability and show that in majority cases, VNS spends ten times less CPU time as opposed to TS. In conclusion, the authors argue that VNS heuristic is appropriate for resolving this static RWA problem.
Publisher: The Institution of Engineering and Technology

Show full item record


checked on Nov 27, 2023

Page view(s)

checked on Nov 28, 2023

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.