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

FONT face; Verdana; SHAN Guang-jun; ZHU Guang-xi; LIU De-ming; LI Jian-ming; FONT

您当前的位置：

首页 >

文章列表页 >

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

更新时间：2025-07-16

- An Dynamic Routing and Wavelength Assignment Algorithm Based on Key Links Forecasting
- Acta Electronica Sinica Vol. 38, Issue 7, Pages: 1673-1677(2010)
- 作者机构：
  
  1. 华中科技大学电子与信息工程系,湖北,武汉,430074
  2. 武汉光电国家实验室,湖北,武汉,430074
  3. 华中科技大学光电子科学与工程学院,湖北,武汉,430074
  4. 湖北省电力信息通信中心,湖北,武汉,430077
- 作者简介：
- 基金信息：
- DOI：
  CLC： TN929.11
- Published：2010
- 稿件说明：
移动端阅览
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, 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>光网络中的路由和波长分配（RWA）算法是NP难问题. 目前的解决方案大多是基于启发式算法或图论的，其计算复杂度往往随着网络规模的增加呈指数增长，而且链路阻塞概率建模也十分困难. 本文提出了一种基于“关键链路”预测机制的RWA算法，并综合考虑跳数和空闲波长数的因素，不仅通过链路层面，而且也从网络层面来解决RWA问题. 实验结果表明我们的算法可以实现很好的流量负载均衡和低的阻塞率，具有较小的计算复杂度.

Abstract

<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.

关键词

Keywords

references

Views

1308

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Edge Serial Message Passing Algorithm Based on Subgraph

Generalization of Zero‑Padded Tri‑Mode OFDM with Index Modulation Based on Three‑Stage LLR Detection

Dynamic Joint Nearest Neighbor Algorithm

An Integrated Metrics Based Extended Dynamic Source Routing Protocol in Wireless Mesh Networks

Related Author

JIA Zhi-hao

SUN Jun

CHEN Zhen‑xing

CHEN Zhi-hui

WANG Meng‑yi

FONT

ZHANG Hao-feng

ZHAO Chun-xia

Related Institution

Jiangsu Key Laboratory of Wireless Communications， Nanjing University of Posts and Telecommunications

School of Mechanical Engineering and Electronic Information， China University of Geosciences

School of Artificial Intelligence， North China University of Science and Technology

School of Electronic Information， Wuhan University

College of Computer and Information EngineeringHenan UniversityKaifengHenan 475004China

⁰