WDM全光网络中优化组播路由的遗传算法  

Genetic Algorithm for Optimizing Multicast Route in WDM Networks

作　　者：王清[1] 欧阳伟[1] 曹文君[1] 

机构地区：[1]复旦大学计算机与信息技术系,上海200433

出　　处：《计算机工程》2006年第18期103-105,共3页Computer Engineering

摘　　要：在WDM网络中,路由和波长分配是紧密联系在一起的,即在建立光连接的过程中,不但需要确定路由,还要为该路由分配合适的波长资源。该文给出了一种遗传算法以解决在给定一组时延受限的组播请求的情况下,如何为这些组播请求建立合适的组播路由树,从而使得该组组播树所占用的波长数最小的问题。通过使用一种合适的二维染色体编码表示,并设计适合问题的交叉和变异操作,从而算法可以有效地搜索假设空间,实验模拟结果表明了该算法具有快速有效的特点。In WDM networks, ruuting and wavelength assignment （RWA） is tightly integrated, i.e. in establishing an optical connection, it must deal with both selecting a suitable path and allocating an available wavelength tot the connection. This paper proposes a genetic algorithm for the problem of mininizing the number of wavelength required in a network for a given set of delay-constraint multicast requests, which can efficiently exploits the combination of alternative delay-constraint paths for the given multicast requests through a suitable two-dimensional chromosome representution and crussover and mutation operaturs. Simulation result shows that the proposed algorithm can produce suboptimal delay-constraint routing trees that substantially save the number of wavelength used quickly.

关 键 词：WDM网络 细播路由 波长分配 遗传算法 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]