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

HEURISTIC ALGORITHM FOR MINIMIZING THE NUMBER OF WAVELENGTHS IN VWP OPTICAL NETWORKS

作　　者：张杰[1] 顾畹仪[1] 李国瑞[1] 徐大雄[1] 

机构地区：[1]北京邮电大学电信工程学院,北京100088

出　　处：《光子学报》1997年第10期915-918,共4页Acta Photonica Sinica

摘　　要：本文提出了一种虚波长路径光网络的启发式路由选择算法，它可以用来解决以最小化网络所需波长数目为目标的资源优化问题．该算法应用了基于最大概率路径的选路优化策略．对一个样例网络的数值分析结果表明该算法是有效的．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.

关 键 词：波分复用 虚波长路径 启发式算法 光网络 

分 类 号：TN929.1[电子电信—通信与信息系统]