Effect of selection heuristics on routing and wavelength assignment using greedy EDP algorithm

Routing and wavelength assignment (RWA) problem in wavelength routed optical networks is known to be NP-complete. Problems of routing and wavelength assignment have been individually solved using techniques such as integer programming which are complex and computationally expensive. RWA with greedy maximum edge disjoint path (EDP) algorithm solves routing and wavelength assignment problems simultaneously and is shown to be as good as previously known solution methods. In this paper, we study effect of selection heuristics, for a lightpath to be routed and a route assigned to it, in this greedy EDP for RWA. Then, we present their comparative performances using parameters such as number of wavelengths required to satisfy a given set of lightpaths and blocking probability in case of limited wavelengths.