Roteamento adaptativo com agregação de tráfego em redes ópticas dinâmicas.

Abstract

This work discusses the problem of dynamic routing and wavelength assignment in WDM optical networks, without wavelength conversion. Two traffic engineering strategies are considered: load balancing, using adaptive routing, and traffic grooming. For the adaptive routing, five weigh functions are studied, of which one is proposed and the others were obtained from the literature, associated to the Dijkstra algorithm and the first-fit wavelength assignment heuristic. The traffic grooming algorithm considers the wavelength sub-channel bandwidth allocated on demand, which is distinct from the usual literature approach. The adaptive routing and traffic grooming algorithms are compared, in terms of blocking probability link average utilization, to three topologies, which include a six node network, the NSF network and one ring tree. Three scenarios are considered in the analysis. Adaptive routing is considered for the first scenario, without traffic grooming. Grooming alone is considered for the second. The third scenario includes both techniques as means to improve the resource distribution in the network. The results show that integration of adaptive routing algorithm with traffic grooming for routing and wavelength assignment improves better performance with respect to blocking probability and load distribution between the links of the network.