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 al...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.展开更多
In this paper, a novel method is proposed to address the problem of designing virtual topology over wavelength division multiplexing （WDM） networks under bandwidth demand uncertainties. And a bandwidth demand model ...In this paper, a novel method is proposed to address the problem of designing virtual topology over wavelength division multiplexing （WDM） networks under bandwidth demand uncertainties. And a bandwidth demand model under uncertainties is presented. The optimization goal of virtual topology design is defined as minimizing the maximum value amongp percentiles of the bandwidth demand distribution on all Hght-paths. Correspondingly, we propose a heuristic algorithm called an improved decreasing multi-hop logical topology design algorithm （ID-MLTDA） that involves with a degree of uncertainties to design virtual topology. The proposed algorithm yields better performance than previous algorithms. Additionally, the simplicity and efficiency of the proposed algorithm can be in favor of the feasibility for topology design of large networks.展开更多
基金Supported by National Science Foundation of China(No.60272048)
文摘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.
基金Supported by the National Natural Science Foundation of China (No.90604002)Program for New Century Excellent Talents in University (No. 05-0807).
文摘In this paper, a novel method is proposed to address the problem of designing virtual topology over wavelength division multiplexing （WDM） networks under bandwidth demand uncertainties. And a bandwidth demand model under uncertainties is presented. The optimization goal of virtual topology design is defined as minimizing the maximum value amongp percentiles of the bandwidth demand distribution on all Hght-paths. Correspondingly, we propose a heuristic algorithm called an improved decreasing multi-hop logical topology design algorithm （ID-MLTDA） that involves with a degree of uncertainties to design virtual topology. The proposed algorithm yields better performance than previous algorithms. Additionally, the simplicity and efficiency of the proposed algorithm can be in favor of the feasibility for topology design of large networks.
