论文部分内容阅读
本文提出了一种新的启发式算法，它将路由和波长分配问题分解为两个子问题分别进行优化求解，并以最小化波长需求作为目标函数．在不同通信负荷的情况下，我们以NSF网为例，分析了波长通道（WP）和虚波长通道（VWP）路由方案之间在波长需求方面的差别．同时还研究了网络波长重用度的问题．数值结果表明所提出的算法可有效地应用于大规模波长路由光网．
In this paper, a new heuristic algorithm is proposed, which decomposes the routing and wavelength assignment into two sub-problems respectively and optimizes them separately. The objective function is to minimize the wavelength requirement. Taking the NSF network as an example, we analyze the difference in wavelength requirements between wavelength channel (WP) and virtual wavelength channel (VWP) routing schemes under different traffic load. At the same time also studied the problem of network wavelength reuse. The numerical results show that the proposed algorithm can be effectively applied to large-scale wavelength routing optical networks.