Routing, Wavelength Assignment in Optical Networks Using an Efficient and Fair EDP Algorithm

摘要

Routing and wavelength assignment (RWA) problem in wavelength routed optical networks is typically solved using a combination of integer programming and graph coloring. Such techniques are complex and make extensive use of heuristics. RWA with maximum edge disjoint path (EDP) using simple bounded greedy algorithm is shown to be as good as previously known solution method. In this paper, we present shortest path first greedy algorithm for maximum EDP with construction of path conflict graph which gives fair and efficient solution to the RWA problem in optical networks.