ContribuiÃÃes ao algoritmo de roteamento para redes Ãpticas baseado na figura de ruÃdo e nas penalidades fÃsicas / Contributions to the routing algorithm for optical networks based on noise figure and physical impairments

AUTOR(ES)
DATA DE PUBLICAÇÃO

2006

RESUMO

This dissertation demonstrates a novel dynamic routing algorithm for transparent optical networks based on physical layer impairments such as, amplifier noise accumulation, amplifier gain saturation and device losses along lightpaths. The metric of the algorithm is based on the calculation of the noise figure using the well known formulation for a cascade of elements in the lightpaths. No wavelength conversion capabilities was assumed in our network and the wavelength assignment is based on a first fit algorithm. For a given call the algorithm assigns the first available wavelength and calculates the best route (minimum noise figure) using a modified Dikjstra algorithm with the noise figure as the cost function. After the calculation of the noise figure of the lightpath the bit error rate (BER) is obtained. The novel algorithm blocks a call if there is no wavelength available or if the BER for the available wavelength is above a given level, which guarantees a pre-defined quality-of-service for the network operation. Simulation results of dynamic traffic in a hypothetical meshed network are presented in terms of blocking probabilities as a function of network load and amplifier characteristics. They show that the proposed algorithm outperforms the traditional shortest path routing algorithm. The algorithm is also extended to multifiber networks

ASSUNTO(S)

optical networks redes Ãpticas rwa noise figure engenharia eletrica comunicaÃÃes Ãpticas figura de ruÃdo optics communication rwa

ACESSO AO ARTIGO

Documentos Relacionados