Title :
Method to Ensure a Feasible Wavelength Assignment within the Routing-Only Problem for Transparent WDM Networks
Author :
Meusburger, Clara ; Schupke, Dominic A.
Author_Institution :
Nokia Siemens Network GmbH & Co. KG, Munich
Abstract :
In transparent WDM networks, the optimization problem contains the routing and the wavelength assignment problem, which leads to a high computational complexity. We suggest a set of constraints which either ensures a wavelength assignment solution for a calculated routing, or tests a preprocessed routing for a feasible wavelength assignment. First case studies show a remarkable speed up in calculation time as well as an evaluation of the optimality of the planning solution.
Keywords :
computational complexity; graph colouring; optical fibre networks; optimisation; telecommunication network planning; telecommunication network routing; wavelength assignment; wavelength division multiplexing; computational complexity; graph coloring problem; optical-network planning method; optimization problem; routing-only problem; transparent WDM networks; wavelength assignment; Computational complexity; Optical fiber networks; Optical wavelength conversion; Repeaters; Spine; Testing; WDM networks; Wavelength assignment; Wavelength division multiplexing; Wavelength routing; RWA; WDM; calculation time reduction; graph coloring; optical networks;
Conference_Titel :
Transparent Optical Networks, 2007. ICTON '07. 9th International Conference on
Conference_Location :
Rome
Print_ISBN :
1-4244-1249-8
Electronic_ISBN :
1-4244-1249-8
DOI :
10.1109/ICTON.2007.4296354
