Performance evaluation of heuristic algorithms for routing and wavelength assignment in WDM optical networks

DOI10.1080/17445760902894639MaRDI QIDQ3585340zbMATH OpenOpenAlexFDO

Authors Keqin Li

Publication date 19 August 2010

Published in International Journal of Parallel, Emergent and Distributed Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/17445760902894639

zbMATH Keywords

heuristic algorithmroutingwavelength division multiplexingwavelength assignmentoptical networkaverage-case performancethroughput maximisation

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Experimental average-case performance evaluation of online algorithms for routing and wavelength assignment and throughput maximization in WDM optical networks
• Routing and wavelength assignment in optical networks using bin packing based algorithms
• A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks
• Provably good algorithms for transmission scheduling in WDM optical networks
• Solving routing and wavelength assignment problem with maximum edge-disjoint paths

Cited in

(4)

• A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks
• Experimental average-case performance evaluation of online algorithms for routing and wavelength assignment and throughput maximization in WDM optical networks
• Evaluation performance of genetic algorithm and tabu search algorithm for solving the MAX-RWA problem in all-optical networks
• Nature-inspired metaheuristic algorithms to find near-OGR sequences for WDM channel allocation and their performance comparison

This page was built for publication: Performance evaluation of heuristic algorithms for routing and wavelength assignment in WDM optical networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3585340)