一种求解虚波长路径光网络波长资源优化问题的启发式算法

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.