An Application of Heuristic Algorithm Based on Route Minimum Cost for RWA in All-Optical WDM Networks

摘要

In this paper a heuristic algorithm based on alternate routing approach that considers jointly every route-wavelength pair in order to choose one with a minimum cost to establish a lightpath is applied for solving the RWA (Routing and Wavelength Assignment) problem in optical WDM (Wavelength Division Multiplexing) network in a case of dynamic traffic demands. We performed numerous simulations to obtain and analyse the blocking probability performance of this algorithm. The programme code we developed for simulation can be efficiently applied for various network topologies as well as for various traffic demands, number of wavelengths and number of alternate routes in a given network.