摘要
本文研究了波长转换范围受限全光网中的动态路由和波长分配问题 ,提出了一种固定备选路由条件下新的路由和波长分配算法 .算法引入了波长相关性的概念 ,用波长关联权值定量描述了各路由的前后链路上不同波长之间的相互依赖关系 .在建立连接时首先使用那些依赖性强 ,对其他路由影响小的波长 ,从全局的角度出发选择最优的路由和波长分配方案 .计算机仿真表明 ,本文算法能够适用于稀疏网络和网状网 ,在均匀业务强度或者大部分业务量来自于长跳路由的情况下 ,本文算法能够显著降低网络阻塞概率和使用的波长转换器数目 。
A dynamic routing and wavelength assignment algorithm in all-optical network with limited-range wavelength conversion was proposed. The correlation of different wavelengths on different links in all possible routes is described by wavelength weight. Attempts are made to assign wavelengths on each candidate route using shortest-path algorithm based on wavelength weight and choose the best as its route and wavelength assignment scheme. Numerical results obtained for NSFNET and 12-node ring show that our algorithm can greatly reduce the blocking probability and the number of converters needed under uniform traffic or traffic dominated by larger hop routes.
出处
《电子学报》
EI
CAS
CSCD
北大核心
2003年第5期717-720,共4页
Acta Electronica Sinica
基金
国家自然科学基金 (No 90 1 0 4 0 1 2 )
关键词
全光网
范围受限波长转换
路由和波长分配算法
Algorithms
Computer simulation
Routers
Telecommunication networks
Wavelength division multiplexing