摘要
Dynamic routing and wavelength assignment in the wavelength division multiplex optical networks with both dynamic service traffic and limited-range wavelength conversion have been discussed. Based on Moone-Dijkstra algorithm, a novel heuristic dynamic min-cost & optimal virtual wavelength path (DMC-OVWP) algorithm is proposed, in which the probability and limitation of wavelength conversion are taken into account. With separation and combination of routing and wavelength assignment sub-problems, RWA problem is optimized. The simulation results for the topology like China Education and Research Network using the algorithm show that low blocking probability is obtained.
Dynamic routing and wavelength assignment in the wavelength division multiplex optical networks with both dynamic service tragic and limited-range wavelength conversion have been discussed. Based on Moone-Dijkstra algorithm, a novel heuristic dynamic mincost & optimal virtual wavelength path (DMC-OVWP) algorithm is proposed, in which the probability and limitation of wavelength conversion are taken into account. With separation and combination of routing and wavelength assignment sub-problems, RWA problem is optimized. The simulation results for the topology like China Education and Research Network using the algorithm show that low blocking probability is obtained.
基金
Supported by National Science Foundation of China(No.60272048)
关键词
DMC-OVWP算法
动态噪声抑制
光网
光通信
dynamic muting
DWC-OVWP
wavelength conversion
virtual wavelength path
link weight