In wavelength division multiplexing (WDM) networks without wavelengthconversion functionality, we convert the dynamic routing and wavelength assignment problem formulti-lightpath demands to the edge-disjoint paths pro...In wavelength division multiplexing (WDM) networks without wavelengthconversion functionality, we convert the dynamic routing and wavelength assignment problem formulti-lightpath demands to the edge-disjoint paths problem, and propose a new algorithm. Thecomputer simulations show that the proposed algorithm has better blocking probability performancethan a sequential algorithm, which first separates a multi-lightpath demand into mutilplesingle-lightpath demands, then uses the fixed-alternate routing-first fit wavelength assignment(AR-FF) algorithm for each single-lightpath demand.展开更多
基金Supported by the National High Technology Development 863 Program of China(2001AA122023)
文摘In wavelength division multiplexing (WDM) networks without wavelengthconversion functionality, we convert the dynamic routing and wavelength assignment problem formulti-lightpath demands to the edge-disjoint paths problem, and propose a new algorithm. Thecomputer simulations show that the proposed algorithm has better blocking probability performancethan a sequential algorithm, which first separates a multi-lightpath demand into mutilplesingle-lightpath demands, then uses the fixed-alternate routing-first fit wavelength assignment(AR-FF) algorithm for each single-lightpath demand.
