作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2006, Vol. 32 ›› Issue (18): 103-105. doi: 10.3969/j.issn.1000-3428.2006.18.037

• 网络与通信 • 上一篇    下一篇

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

王 清;欧阳伟;曹文君   

  1. 复旦大学计算机与信息技术系,上海 200433
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2006-09-20 发布日期:2006-09-20

Genetic Algorithm for Optimizing Multicast Route in WDM Networks

WANG Qing;OUYANG Wei;CAO Wenjun   

  1. Department of Computer and Information Technology, Fudan University, Shanghai 200433
  • Received:1900-01-01 Revised:1900-01-01 Online:2006-09-20 Published:2006-09-20

摘要: 在WDM网络中,路由和波长分配是紧密联系在一起的,即在建立光连接的过程中,不但需要确定路由,还要为该路由分配合适的波长资源。该文给出了一种遗传算法以解决在给定一组时延受限的组播请求的情况下,如何为这些组播请求建立合适的组播路由树,从而使得该组组播树所占用的波长数最小的问题。通过使用一种合适的二维染色体编码表示,并设计适合问题的交叉和变异操作,从而算法可以有效地搜索假设空间,实验模拟结果表明了该算法具有快速有效的特点。

关键词: WDM网络, 组播路由, 波长分配, 遗传算法

Abstract: In WDM networks, routing 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 for the connection. This paper proposes a genetic algorithm for the problem of minimizing 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 representation and crossover and mutation operators. Simulation result shows that the proposed algorithm can produce suboptimal delay-constraint routing trees that substantially save the number of wavelength used quickly.

Key words: WDM network, Multicast route, Wavelength assignment, Genetic algorithm