Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Performance Analysis of GA, ROA, and TSA for Solving the Max-RWA Problem in Optical Networks

Not Accessible

Your library or personal account may give you access


In this paper the Max-RWA problem was mathematically formulated and solved approximately by three efficient random search algorithms namely Random Optimization Algorithm (ROA), Genetic Algorithm (GA) and Tabu Search Algorithm (TSA). The routing subproblem was insured exactly by the backtracking algorithm. TSA achieves up to a 23% improvement over GA and a 10% improvement over ROA.

© 2014 Optical Society of America

PDF Article
More Like This
A Dual Metaheuristic Solution to the Min-RWA Problem

Daniel O’Brien, Benoît Châtelain, François Gagnon, Christine Tremblay, Michel P. Bélanger, and Éric Bernier
JThA80 National Fiber Optic Engineers Conference (NFOEC) 2008

Greedy RWA algorithm for scheduled traffic in multi-domain optical networks

Deepak Batham, Dharmendra Singh Yadav, and Shashi Prakash
T3A.53 International Conference on Fibre Optics and Photonics (Photonics) 2014

Scalable Traffic Grooming in Optical Networks

Hui Wang, Zeyu Liu, and George N. Rouskas
AS3D.2 Asia Communications and Photonics Conference (ACP) 2012

Poster Presentation

Media 1: PDF (1133 KB)     
Select as filters

Select Topics Cancel
© Copyright 2023 | Optica Publishing Group. All Rights Reserved