Heuristic for Routing and Wavelength Assignment in de Bruijn WDM networks based on Graph Decomposition

An important parameter for performance analysis of Routing and Wavelength Assignment (RWA) strategies in WDM networks is blocking probability. Past research has shown that the process in which RWA is carried out significantly affects the wavelength conversion requirements, which in turn affects blocking probability. In this paper we propose a new strategy GDWA (Graph Decomposition based Wavelength Assignment) for static Wavelength Assignment (WA) in a special class of WDM networks which are based on de Bruijn graph. We combine our own request routing strategy LBR (Load Balanced Routing) with the new WA strategy effectively to propose a new static polynomial time RWA heuristic LBGD-RWA (Load Balancing with Graph Decomposition based RWA). We compare the performance of our heuristic with three alternate RWA strategies. Performance comparison reveals that the proposed heuristic gives the best blocking performance.