首页 | 官方网站   微博 | 高级检索  
     

基于禁忌搜索算法求解全光网路由和波长分配问题
引用本文:张奭,秦浩,刘增基.基于禁忌搜索算法求解全光网路由和波长分配问题[J].计算机学报,2004,27(3):302-309.
作者姓名:张奭  秦浩  刘增基
作者单位:西安电子科技大学综合业务网国家重点实验室,西安,710071
基金项目:国家自然科学基金 ( 90 1 0 40 1 2 )资助
摘    要:该文是基于禁忌搜索算法对一类全光网路由和波长分配MAX-RWA问题进行求解.该文针对配置范围受限波长转换器的全光网,强化了MAX-RWA问题的优化目标.新的优化目标是保证连接数最多的情况下使用最少的波长转换器,从而尽可能地减少波长转换器引入的信号失真;简化了文献7]中分层图的构造方法,并利用改进的分层图给出了MAX-RWA问题的整数线性规划和禁忌搜索算法的设计.仿真结果和理论上界的对比表明该文算法是稳定、有效的.

关 键 词:全光网  路由分配  波长分配  禁忌搜索算法  波分复用  电路交换网络

Routing and Wavelength Assignment in All-Optical Network Using Tabu-Search Algorithm
ZHANG Shi,QIN Hao,LIU Zeng,Ji.Routing and Wavelength Assignment in All-Optical Network Using Tabu-Search Algorithm[J].Chinese Journal of Computers,2004,27(3):302-309.
Authors:ZHANG Shi  QIN Hao  LIU Zeng  Ji
Abstract:This paper investigates the problem of RWA (Routing and Wavelength Assignment) in all optical network using Tabu search algorithm. For all optical networks with limited range wavelength converters, the objective of MAX RWA is enhanced, which is to establish as many connections as possible using the least number of wavelength converters. Hence the signal distortion incurred by wavelength converters is minimized. A simplified layered graph model is presented based on the model presented by Hiroaki Harai et al. in 1997. By this model, authors give the ILP (Integer Linear Programming) formulation of MAX RWA problem and the details of the Tabu search algorithm. Numerical results obtained are presented. The comparison between simulation results and theoretical upper bounds shows that our algorithm is stable and effective.
Keywords:tabu  search  layered  graph  routing and wavelength assignment  wavelength converter
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号