HEURISTIC ALGORITHM FOR MINIMIZING THE NUMBER OF WAVELENGTHS IN VWP OPTICAL NETWORKS
一种求解虚波长路径光网络波长资源优化问题的启发式算法

This paper proposes a path accommodation design algorithm applicable to virtual wavelength path networks that heuristically minimize the number of wavelengths required by the realization of optical paths. A new optimal routing strategy based on the maximum probability paths is introduced in the algorithm. At last, the numerical results of a sample network show the effect of the algorithm.