An Dynamic Routing and Wavelength Assignment Algorithm Based on Key Links Forecasting
电子学报2010年38卷第7期 页码:1673-1677
作者机构:
1. 华中科技大学电子与信息工程系,湖北,武汉,430074
2. 武汉光电国家实验室,湖北,武汉,430074
3. 华中科技大学光电子科学与工程学院,湖北,武汉,430074
4. 湖北省电力信息通信中心,湖北,武汉,430077
作者简介:
基金信息:
DOI:
中图分类号:TN929.11
纸质出版:2010
稿件说明:
移动端阅览
FONT face, Verdana, 单广军, 等. 基于关键链路预测的动态路由和波长分配算法[J]. 电子学报, 2010,38(7):1673-1677.
FONT face, Verdana, SHAN Guang-jun, et al. An Dynamic Routing and Wavelength Assignment Algorithm Based on Key Links Forecasting[J]. Acta Electronica Sinica, 2010, 38(7): 1673-1677.
FONT face, Verdana, 单广军, 等. 基于关键链路预测的动态路由和波长分配算法[J]. 电子学报, 2010,38(7):1673-1677.DOI:
FONT face, Verdana, SHAN Guang-jun, et al. An Dynamic Routing and Wavelength Assignment Algorithm Based on Key Links Forecasting[J]. Acta Electronica Sinica, 2010, 38(7): 1673-1677.DOI:
<FONT face=Verdana>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.