Dynamic Routing and Wavelength Assignment for Multi-Lightpath Demands

In wavelength division multiplexing(WDM) networks without wavelength conversion functionality, we convert the dynamic routing and wavelength assignment problem for multi\|lightpath demands to the edge\|disjoint paths problem, and propose a new algorithm. The computer simulations show that the proposed algorithm has better blocking probability performance than a sequential algorithm, which first separates a multi\|lightpath demand into mutilple single\|lightpath demands, then uses the fixed\|alternate routing\|first fit wavelength assignment (AR\|FF) algorithm for each single\|lightpath demand.