Routing and wavelength assignment of scheduled lightpath demands
Authors:
- E. DotaroEDE. Dotaro
- R. DouvilleRDR. Douville
- 7 October 2003
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 21 (8) , 1231-1240
Abstract
We present algorithms that compute the routing and wavelength assignment (RWA) for scheduled lightpath demands in a wavelength-switching mesh network without wavelength conversion functionality. Scheduled lightpath demands are connection demands for which the setup and teardown times are known in advance. We formulate separately the routing problem and the wavelength assignment problem as spatio-temporal combinatorial optimization problems. For the former, we propose a branch and bound algorithm for exact resolution and an alternative tabu search algorithm for approximate resolution. A generalized graph coloring approach is used to solve the wavelength assignment problem. We compared the proposed algorithms to an RWA algorithm that sequentially computes the route and wavelength assignment for the scheduled lightpath demands.Keywords
This publication has 9 references indexed in Scilit:
- Diverse routing of scheduled lightpath demands in an optical transport network2004
- Routing foreseeable lightpath demands using a tabu search meta-heuristic2003
- ROUTING AND WAVELENGTH ASSIGNMENT OF SCHEDULED LIGHTPATH DEMANDS IN A WDM OPTICAL TRANSPORT NETWORK2002
- On the best search strategy in parallel branch‐and‐bound:Best‐First Search versus Lazy Depth‐First SearchAnnals of Operations Research, 1999
- Efficient coloring of a large spectrum of graphs1998
- Finding the k Shortest PathsSIAM Journal on Computing, 1998
- Tabu Search1997
- Lightpath communications: an approach to high bandwidth optical WAN'sIEEE Transactions on Communications, 1992
- A very fast shift-register sequence random number generatorJournal of Computational Physics, 1981