SciELO - Scientific Electronic Library Online

 
vol.25 número4Uso de las Redes Neuronales Artificiales en el Modelado del Ensayo de Resistencia a Compresión de Concreto de Construcción según la Norma ASTM C39/C 39MSimulación de un Reactor Anaerobio Discontinuo utilizado para la Producción de Hidrógeno mediante Dinámica de Fluidos Computacional índice de autoresíndice de assuntospesquisa de artigos
Home Pagelista alfabética de periódicos  

Serviços Personalizados

Journal

Artigo

Indicadores

Links relacionados

  • Em processo de indexaçãoCitado por Google
  • Não possue artigos similaresSimilares em SciELO
  • Em processo de indexaçãoSimilares em Google

Compartilhar


Información tecnológica

versão On-line ISSN 0718-0764

Resumo

RODRIGUEZ, Arturo B; GUTIERREZ, Antonio L; RIVERA, Luis A  e  RAMIREZ, Leonardo J. Routing and Wavelength Assignement: Comparison of Simulated Annealing and Genetics Algortihm. Inf. tecnol. [online]. 2014, vol.25, n.4, pp.13-18. ISSN 0718-0764.  http://dx.doi.org/10.4067/S0718-07642014000400003.

In this paper compares studies over routing and wavelength assignment for better some services indicators, such as blocking probability and network utilization. In modern telecommunications are gradually subjected to increased demand, which results in higher requirements in photonic transport networks. This phenomenon forces us improve routing systems, in order to better serve current demand and have capacity of attention of future demand. The comparison is made between the algorithms Genetic Algorithms and Simulated Annealing, both simulated in the optical network NSFNET using wavelength division multiplexing WDM. The results showed that heuristic algorithms are better in dynamic demand and high charge, functioning better under stress. It is concluded that genetic algorithms provide the best solution for future demand.

Palavras-chave : .

        · resumo em Espanhol     · texto em Espanhol     · Espanhol ( pdf )

 

Creative Commons License Todo o conteúdo deste periódico, exceto onde está identificado, está licenciado sob uma Licença Creative Commons