Abstract
The widespread deployment of WDM optical networks posts lots of new challenges for network designers. Traffic grooming is one of the most common problems. Efficient grooming of traffic can effectively reduce the overall cost of the network. But unfortunately, traffic grooming problems have been shown to be NP-hard. Therefore, new heuristics must be devised to tackle them. Among these approaches, metaheuristics are among the most promising ones. In this paper, we present a thorough and comprehensive survey on various metaheuristic approaches to the grooming of traffic in both static and dynamic patterns in WDM optical networks. Some future challenges and research directions are also discussed in this paper.
Original language | English |
---|---|
Pages (from-to) | 231-249 |
Number of pages | 19 |
Journal | International Journal of Computational Intelligence and Applications |
Volume | 5 |
Issue number | 2 |
DOIs | |
Publication status | Published - Jun 2005 |
Externally published | Yes |
Keywords
- WDM optical network
- traffic grooming
- genetic algorithm
- tabu search
- simulated annealing