基于关键链路预测的动态路由和波长分配算法  

An Dynamic Routing and Wavelength Assignment Algorithm Based on Key Links Forecasting

作　　者：单广军[1,2,3] 朱光喜[4,1] 刘德明[2] 李建明[4] 

机构地区：[1]武汉光电国家实验室,湖北武汉430074 [2]华中科技大学光电子科学与工程学院,湖北武汉430074 [3]湖北省电力信息通信中心,湖北武汉430077 [4]华中科技大学电子与信息工程系,湖北武汉430074

出　　处：《电子学报》2010年第7期1673-1677,共5页Acta Electronica Sinica

基　　金：国家自然科学基金(No.60972016;No.60496315;No.60802009);国家863高技术研究发展计划(No.2009AA01Z05)

摘　　要：光网络中的路由和波长分配(RWA)算法是NP难问题.目前的解决方案大多是基于启发式算法或图论的,其计算复杂度往往随着网络规模的增加呈指数增长,而且链路阻塞概率建模也十分困难.本文提出了一种基于"关键链路"预测机制的RWA算法,并综合考虑跳数和空闲波长数的因素,不仅通过链路层面,而且也从网络层面来解决RWA问题.实验结果表明我们的算法可以实现很好的流量负载均衡和低的阻塞率,具有较小的计算复杂度.It have been proved that RWA（routing and wavelength assignment） algorithm in arbitrary mesh optical networks is a NP-complete problem.Previous works intended to address this problem through heuristics method or graph theory.However,the computational complexity will be increased exponentially with the network size,also,the mathematical modeling for link blocking probability is quite complicated.We propose a novel RWA algorithm that is based on the ＂Key Link＂ forecasting mechanism and jointly take the hop number and free wavelength number into account,thus,it not only addresses RWA problem from link level（setting dynamic weight）,also from network level（proactively avoiding ＂key links＂）.Results show our scheme can achieve better load balance and lower blocking ratio with low computational complexity.

关 键 词：光网络 路由和波长分配(RWA)算法 计算复杂度 阻塞率 负载均衡 

分 类 号：TN929.11[电子电信—通信与信息系统]