A Distributed Memetic Algorithm for the Routing and Wavelength Assignment Problem

Authors:
Thomas Fischer;Kerstin Bauer;Peter Merz
Affiliations:
Department of Computer Science, University of Kaiserslautern, Germany;Department of Computer Science, University of Kaiserslautern, Germany;Department of Computer Science, University of Kaiserslautern, Germany
Venue:
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Year:
2008

Citing 5
Cited 1

Epidemic algorithms for replicated database maintenance

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Gossip-based peer sampling

ACM Transactions on Computer Systems (TOCS)
A Multilevel Approach for the Routing and Wavelength Assignment Problem

SAINT '08 Proceedings of the 2008 International Symposium on Applications and the Internet
Improved construction heuristics and iterated local search for the routing and wavelength assignment problem

EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
Partition inequalities for capacitated survivable network design based on directed p-cycles

Discrete Optimization

Distributed dynamic grooming routing and wavelength assignment in WDM optical mesh networks

Photonic Network Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Routing and Wavelength Assignment Problem deals with the routing of telecommunication traffic in all-optical networks. Extending existing algorithms, we present a memetic algorithm (MA) for the static RWA by introducing a recombination operator and a scheme for distributing the computation. Compared to previously achieved results for this problem, our MA significantly improves the solution quality. We find provably optimal results for previously unsolved problem instances. The distributed variant using epidemic algorithms allows to find solutions of quality comparable to the MA in less real-time.