New Heuristic Algorithm for Dynamic Traffic in WDM Optical Networks
The results and comparison of the simulation of a new heuristic algorithm called Snake One are presented. The comparison is made with three heuristic algorithms, Genetic Algorithms, Simulated Annealing, and Tabu Search, using blocking probability and network utilization as standard indicators. The s...
- Autores:
-
Rodríguez Garcia, Arturo Benito
Ramirez Lopez, Leonardo
Travieso Torres, Juan Carlos
- Tipo de recurso:
- Article of journal
- Fecha de publicación:
- 2015
- Institución:
- Universidad Nacional de Colombia
- Repositorio:
- Universidad Nacional de Colombia
- Idioma:
- spa
- OAI Identifier:
- oai:repositorio.unal.edu.co:unal/67649
- Acceso en línea:
- https://repositorio.unal.edu.co/handle/unal/67649
http://bdigital.unal.edu.co/68678/
- Palabra clave:
- 62 Ingeniería y operaciones afines / Engineering
WDM Networks
Heuristic Algorithm
Optical Cross Connect
Dynamic Traffic
NSFNET
Redes WDM
algoritmos heurísticos
conmutadores ópticos
tráfico dinámico
NSFNET.
- Rights
- openAccess
- License
- Atribución-NoComercial 4.0 Internacional
| Summary: | The results and comparison of the simulation of a new heuristic algorithm called Snake One are presented. The comparison is made with three heuristic algorithms, Genetic Algorithms, Simulated Annealing, and Tabu Search, using blocking probability and network utilization as standard indicators. The simulation was made on the WDM NSFNET under dynamic traffic conditions. The results show a substantial decrease of blocking, but this causes a relative growth of network utilization. There are also load intervals at which its performance improves, decreasing the number of blocked requests. |
|---|