摘要
静态的路由选择和波长分配(RWA)问题是波分复用(WDM)光网络中的一个重要问题,目前常用的处理方法是将RWA问题拆成选路子问题和波长分配子问题。静态RWA问题通常先按某种策略确定建立光路的顺序,然后用启发式的算法加以解决。提出通过模拟退火遗传算法对光路的建立顺序进行优化,然后用基于爬山算法的启发式算法可求解以波长数最小为优化目标的静态RWA问题。通过对ARPANet等5种实际光网络的仿真表明,该算法和文献[5]相比,所用的波长数更少,且大部分优化结果达到最优。
Static Routing and Wavelength Assignment （RWA） problems is an important issue for Wavelength Division Multiplexing （WDM） optical networks. In the present practice, such an issue is divided into two minor issues-routing and wavelength assignment. The issue can be solved by determining the light path sequence in some way firstly, then using heuristic algorithm to solve the wavelength assignment problem. The simulated annealing genetic algorithm was adopted to optimize the light path sequence, and the heuristic algorithm based on hill climbing algorithm was used to solve the static RWA problem which aimed at minimizing the number of wavelengths. By emulating five optical networks, such as ARPAnet, it indicates that the proposed algorithm uses fewer wavelengths than the reference [5] does, and obtains the optimization results in most cases.
出处
《计算机应用》
CSCD
北大核心
2006年第7期1552-1553,1566,共3页
journal of Computer Applications
关键词
光网络
路由和波长分配
智能算法
遗传算法
模拟退火
optical network
routing and wavelength assignment（ RWA）
inteUlgent algorithm
genetic algorithm
simulated annealing
