A Heuristic algorithm for reducing wavelength number of optical WDM networks

摘要

This paper proposes a Heuristic algorithm in order to reduce the total number of wavelengths required to accommodate light-paths in a WDM networks with static traffic loading. Proposed algorithm is compared with Dijkstra's algorithm for average light-path length and wavelength number of network. To see the efficiency of this 01algorithm new parameter, reduced wavelength cost (RC_X) has been defined.