Nueva generación de heurísticas para redes de fibra óptica WDM (wavelength division multiplexing) bajo tráfico dinamico

Abstract

This paper presents a new heuristic called Snake and future possibilities for improving the indicators of blocking probability and data transport networks utilization. For this, the algorithms of Simulated Annealing, Genetic Algorithms, Tabu Search Algorithm and the proposed Snake are simulated in the WDM optical network NSFNET. The results show the new algorithm improves the blocking probability but not the display network utilization. The results show that there is a high consumption of network resources which negatively acts to meet future demand. This implies that changes are needed to improve the process and that it is also necessary to develop the algorithms that allow an improvement in both indicators.