A practical RWA algorithm based on maximum EDPS and path conflict graph

In optical transport networks based on wavelength division multiplexing (WDM) technique, one of the important issues is a routing and wavelength assignment (RWA) problem. The performance of optical networks may differ from RWA algorithms. In general, the more complex RWA algorithm is used, the more wavelength resource is saved. In this paper, we propose a novel approach using path conflict graph and an algorithm for finding edge disjoint paths (EDPs) as many as possible. And then we compare performance of the proposed algorithm with that of bounded greedy approach for EDP (BGA for EDP) algorithm.