摘要
该文是基于禁忌搜索算法对一类全光网路由和波长分配MAX RWA问题进行求解 .该文针对配置范围受限波长转换器的全光网 ,强化了MAX RWA问题的优化目标 .新的优化目标是保证连接数最多的情况下使用最少的波长转换器 ,从而尽可能地减少波长转换器引入的信号失真 ;简化了文献 [7]中分层图的构造方法 ,并利用改进的分层图给出了MAX RWA问题的整数线性规划和禁忌搜索算法的设计 .仿真结果和理论上界的对比表明该文算法是稳定、有效的 .
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. In 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 this algorithm is stable and effective.
出处
《计算机学报》
EI
CSCD
北大核心
2004年第3期302-309,共8页
Chinese Journal of Computers
基金
国家自然科学基金 ( 90 1 0 40 1 2 )资助