DocumentCode
1582040
Title
Which of the shortest paths should we choose? A proposal of routing in the all-optical WDM networks design
Author
Durães, G.M. ; Assis, K.D.R. ; Santos, A.F. ; Soares, A.C.B. ; Giozza, W.F.
Author_Institution
UFBA-Fed. Univ. of Bahia, Salvador, Brazil
fYear
2010
Firstpage
1
Lastpage
4
Abstract
We propose to use an iterative heuristic for the shortest path routing in static RWA problem of optical networks. The heuristic´s performance is compared, in terms of number of wavelengths, with the shortest Dijkstra´s path algorithm. The results suggest that it is feasible to choose routes, among the shortest paths, minimizing the number of wavelengths. For all studied scenarios, the heuristic achieved superior performance.
Keywords
iterative methods; optical fibre networks; telecommunication network routing; wavelength division multiplexing; all-optical WDM network; iterative heuristic; shortest Dijkstra path algorithm; shortest path routing; static RWA problem; Algorithm design and analysis; Circuits; Design optimization; Iterative algorithms; Optical design; Optical fiber networks; Proposals; WDM networks; Wavelength assignment; Wavelength routing; Lightpath Routing; Optical Networks; RWA;
fLanguage
English
Publisher
ieee
Conference_Titel
Transparent Optical Networks (ICTON), 2010 12th International Conference on
Conference_Location
Munich
Print_ISBN
978-1-4244-7799-9
Electronic_ISBN
978-1-4244-7797-5
Type
conf
DOI
10.1109/ICTON.2010.5549127
Filename
5549127
Link To Document